“…In particular, even though the problem is computationally hard for MoV k-kings for any constant k ≥ 4 (Brill et al 2020b), there exists an efficient heuristic that correctly computes the MoV value in most cases. In the full version (Brill et al 2020a), we give an example showing that the heuristic is not always correct. More precisely, for any positive integer , we construct a tournament such that {MoV TC (x, T ) | x ∈ V (T )} contains the values 1, 2, .…”