Heuristic for the line division problem in computer justified text
Hanan Samet · Communications of the ACM · 1982
equivalent to the task of verifying an inequality proposition regarding the minimax value of a continuousvalued game tree [5] of identical structure, and, consequently, the former cannot be more complex than the latter.Thus, the quantity (~Jl -~n)d should also lower bound the expected number of nodes examined by any algorithm searching a continuous-valued game tree.This, together with Eq. ( 18), establishes the asymptotic optimality of a-ft.