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
Late Move Reductions lead to a different search space than the pure alpha-beta method which can give different results. Care must be taken to select the reduction criteria or the search will miss some deep threats. Late Move Reductions In computer chess, and in other games that computers play, Late Move Reductions (LMR) is a non-game specific enhancement to the alpha-beta algorithm and its variants which attempts to examine a game search tree more efficiently. It uses the assumption that good game-specific move ordering causes a program to search the most likely moves early. If a cut-off is going to happen in a