killer heuristics: remember the last cut off in absearch and try the same one first for other nodes
Also, once a move has been chosen, store each move in the corresponding tree as the next killer move
No dependencies set.
The note is not visible to the blocked user.
killer heuristics: remember the last cut off in absearch and try the same one first for other nodes
Also, once a move has been chosen, store each move in the corresponding tree as the next killer move