The Mijnlieff board game is solved using a modified alpha–beta algorithm with an appropriate move ordering. The perfect game is found to be won by the second player and a new variant is proposed, whose perfect game is draw.
PearlJ. (1982). The solution for the branching factor of the alpha–beta pruning algorithm and its optimality. Communications of the ACM, 25(8), 559–564. https://doi.org/10.1145/358589.358616
