Currently known best algorithm(s) for computer chess?

algorithm chess
anarhikos picture anarhikos · Jan 8, 2010 · Viewed 57.5k times · Source

I just wanted to learn name of algorithms.. thanks

Answer

JaakkoK picture JaakkoK · Jan 8, 2010

A general strategy in game algorithms is the minimax strategy, augmented with alpha-beta pruning. The minimax algorithm finds the best move, and alpha-beta pruning prevents it from going into branches of the game tree that cannot produce a better result than previous branches already have.

However, the chess game tree is too large to be completely examined. That is why computer chess engines only examine the tree up to a certain depth, and then use various methods to evaluate the positions. Many of these methods are based on heuristics. Also, a serious chess-playing program will have a library of openings so that it can play in the beginning by just consulting that library and not having to examine the game tree. Finally, many end games are completely solved, and these are also programmed in as a library.

Related questions

Is there a perfect algorithm for chess?

I was recently in a discussion with a non-coder person on the possibilities of chess computers. I'm not well versed in theory, but think I know enough. I argued that there could not exist a deterministic Turing machine that always …

Read More
Programmer Puzzle: Encoding a chess board state throughout a game

Not strictly a question, more of a puzzle... Over the years, I've been involved in a few technical interviews of new employees. Other than asking the standard "do you know X technology" questions, I've also tried to get a feel …

Read More
Chess game in JavaScript

Is there any Chess game API , purely written in JavaScript ? No Flash! Anybody know the algorithm(in general) used in Chess games ?

Read More