To address the lack of empirical analysis of the NP-complete mutual visibility (MV) problem, this paper implements three algorithms (direct randomized heuristic, hypergraph-based approximation, and genetic algorithm) and evaluates them on various synthetic graph datasets (including datasets with analytically known $\mu(G)$ values).