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
Candidate move simply not capable of performing the complex pattern recognition that was required to find appropriate candidate moves, and that it was easier to have computers perform simple exhaustive searches. Today, most chess programs still rely mainly on brute-force searches, but as search algorithms have improved, today's chess engines seem more and more to be using candidate moves in their analysis. Hydra, for example, is widely considered to be a "Type B" (candidate move finding) computer. Candidate move In abstract strategy board games, candidate moves are moves which, upon initial observation of the position, seem to warrant further analysis. Although in