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 program must make the full-depth search. This approach makes two assumptions. First, it assumes that the disadvantage of forfeiting one's turn is greater than the disadvantage of performing a shallower search. Provided the shallower search is not too much shallower (in practical implementation, the null-move search is usually 2 or 3 plies shallower than the full search would have been), this is usually true. Second, it assumes that the null-move search will produce a cutoff frequently enough to justify the time spent performing null-move searches instead of full searches. In practice, this is also usually true. There are a class