Tuesday, May 10, 2005

How Chess Computers Work

Um artigo fascinante sobre o funcionamento dos computadores no jogo do xadrês. Um computador não "joga" nem "pensa" tal como uma pessoa o faz. Um computador a jogar xadrês "calcula" as variantes e determina o valor final de cada posição, através de uma série de fórmulas e de um "algoritmo de mínimo e máximo" apropriado, o que lhe permite escolher o melhor lance em cada situação.
Como Marshall Brain diz: "If you were to fully develop the entire tree for all possible chess moves, the total number of board positions is about 1, 000, 000, 000, 000, 000,000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, or 10 raised to 120, give or take a few. That's a very big number. For example, there have only been 10 raised to 26 nanoseconds since the Big Bang. There are thought to be only 10 raised to 75 atoms in the entire universe. When you consider that the Milky Way galaxy contains billions of suns, and there are billions of galaxies, you can see that that's a whole lot of atoms. That number is dwarfed by the number of possible chess moves. Chess is a pretty intricate game! No computer is ever going to calculate the entire tree. What a chess computer tries to do is generate the board-position tree five or 10 or 20 moves into the future."
Outro artigo interessante de Ken Thompson sobre xadrês em computadores e Unix.

Labels:

0 Comments:

Post a Comment

<< Home