Monochromatic chess d2 and f2, the white king can move from e1 only with castling and then g1–h2–g3–... so the pawn on g3 cannot be white. In Bichromatic chess, the opposite restrictions apply. A piece on a white square must move to a black square and vice versa. Hence pawns cannot capture (or advance two squares) and bishops cannot move. Also, castling and "en passant" are impossible, and queens behave like rooks. Monochromatic chess Monochromatic chess is a chess variant with unknown origin. The initial board position and all rules are the same as in regular chess, except that pieces that begin
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