Transcendental Chess of one side can be any of 4²×6!÷2² = 2880. There is no castling. On the first turn a player, instead of making a move, can transpose any of two pieces on the back row. In Chess960 the back rows are mirror images, but in Transcendental Chess the setup of black and white is different 2879 out of every 2880 times (there being a 1–in–2880 chance that both sides will draw the same setup). This can create inequalities in the position. One way to equalize these inequalities is to play a couplet: the players play two games, one each as
Null-move heuristic null-move heuristic in zugzwang positions, most chess-playing programs that use the null-move heuristic put restrictions on its use. Such restrictions often include not using the null-move heuristic if Another heuristic for dealing with the zugzwang problem is Omid David and Nathan Netanyahu's verified null-move pruning. In verified null-move pruning, whenever the shallow null-move search indicates a fail-high, instead of cutting off the search from the current node, the search is continued with reduced depth. Null-move heuristic In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm. Alpha-beta pruning speeds