If the position has many tactical variations possible, the answer will probably be very far, 5, 6 or more moves ahead. ?īut to stab at an answer, it would be completely dependent on the position. This is an ill defined question, similar to: what is my girlfriend thinking about when we. This algorithm is knownĪs alfa-beta search or it is some variant of this.Īn important difference is that a computer has to consider things a human takes for granted, such as the concepts behind a known opening, even though a good program can remember which combos work (and rate them, then play based on its ratings), its extremely difficult for it to recognize concepts, such as a fork independent of the result, this can be a advantage because a human may fork, and not see another better future move. Tree of possible moves to find the next move.
Pretty muchĪll engines use the same algorithm for searching through the search Not all - the evaluation function is also very important. MNodes while Deep Blue did about 200 MNodes per second. Fritz running on my old laptop does about 2.5 MNodes/sekund which means million positions (Nodes in computer science Human probably 1-2 positions per second!! Usually speed is measured in from a page called Creating a chess engine from scratch on :Ī computer can easily evaluate a few million positions per second, a however after c3, b5 it should consider d6, and have a reply ready. Much deeper if it is required." For example, in a position involvingįorced moves, it's possible to look ahead as many as 12 or 14 moves,įor a supercomputer it obviously depends on how well-written it is, there is a concept called alpha-beta, which is used to limit thinking into unnecessary moves, like the computer usually wont consider the opponents (white) c3, b5, d6, f7, combo, on the first move. Asked how many moves ahead he can think, Kasparov replied that itĭepended on the positions of the pieces.
0 kommentar(er)
