Candidate Move - Computer Chess

Computer Chess

The ability of humans to find candidate moves remains one of the main differences between them and computers. Although early chess programmers made admirable efforts to make computers able to select candidate moves (see Type A versus Type B programs), they never played particularly well, and were soon supplanted by computers using brute-force algorithms (Shenk, 2006). The addition of Alphabeta algorithms made the latter type even more feasible. Many acknowledged that computers were 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.

Chess

Outline	History World Championship Tournaments Computers Variants Ratings Titles First-move advantage

Pieces	Pawn Knight Bishop Rook Queen King

Rules	Pawn promotion Castling En passant Check Checkmate Double check Draw By agreement Fifty-move rule Threefold repetition Perpetual check Stalemate Touch-move rule Time control Game clock

Terms	Battery Alekhine's gun Blunder Chess engine Chess notation Algebraic Descriptive PGN Annotation symbols Fianchetto Gambit Key square King walk Pawns Connected Isolated Doubled Backward Passed Open file Half-open file Opposition Tempo The exchange Transposition X-ray Zugzwang Zwischenzug

Tactics	Cross-check Decoy Deflection Desperado Discovered attack Fork Interference Overloading Pawn storm Pin Sacrifice Skewer Triangulation Undermining Windmill

Strategies	Artificial castling Exchange Fortress Pawn structure Swindle Tarrasch rule

Main openings	English Opening Queen's Gambit Indian Defence Ruy Lopez Caro–Kann Defence Sicilian Defence French Defence Slav Defense

Endgames	Endgame tablebase King and pawn vs king Opposite-coloured bishops Pawnless endgame Queen and pawn vs queen Queen vs pawn Rook and pawn vs rook Lucena position Philidor position Two knights endgame Wrong bishop Wrong rook pawn

Checkmates	Checkmate pattern Bishop and knight checkmate Back-rank checkmate Fool's mate Scholar's mate Smothered mate Boden's Mate

Read more about this topic: Candidate Move

Famous quotes containing the words computer and/or chess:

“The analogy between the mind and a computer fails for many reasons. The brain is constructed by principles that assure diversity and degeneracy. Unlike a computer, it has no replicative memory. It is historical and value driven. It forms categories by internal criteria and by constraints acting at many scales, not by means of a syntactically constructed program. The world with which the brain interacts is not unequivocally made up of classical categories.”
—Gerald M. Edelman (b. 1928)

“It’s a great huge game of chess that’s being played—all over the world—if this is the world at all, you know. Oh, what fun it is! How I wish I was one of them! I wouldn’t mind being a Pawn, if only I might join—though of course I should like to be a Queen, best.”
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)