Wildebeest Chess moves and captures as a camel and a chess knight. Normal conventions apply when castling, with the only difference that the castling player can choose to slide his king "one", "two", "three", or "four" squares. As in chess, the castling rook finishes on the opposite side of the king on the square adjacent. Bibliography Wildebeest Chess Wildebeest Chess is a chess variant created by R. Wayne Schmittberger in 1987. The Wildebeest board is 11×10 squares. Besides the standard chess pieces, each side has two camels and one wildebeest. The inventor's intent is "to balance the number of 'riders'—pieces that move
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