Two-Move Local Minimum

The DAO currently guarantees that within one move, there is no better place for anyone, but it makes no promise about two moves. Though expensive in runtime, all pairs of moves could be checked. The current engine would require new data structures to maintain a move history to restore state between attempts.

download thesis