Welcome!
How can chess players
beat chess programmes?
How can chess players beat chess programmes?
If every possible chess move was stored in a chess programme, it would be very simple to draw the best move in any given situation. Why do they not do it?
Because the number of moves is so great that all the hard disks in the world are not able to store so much information, nor will they ever be.
That is, the number of possible chess moves is around 1 * 10 on 128 (1 followed by 128 zeros).
On the whole of planet Earth there are around 9 * 10 on 50 atoms. In the part of UNIVERSE known to people there are around 9 * 10 on 80 atoms.
For those who are not so good in Math, it means that in the part of universe known to people there are 1 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 (48 zeros) times less ATOMS than possible chess moves.
"Deep Blue", the famous computer which defeated Kasparov in one match, and which can process 200 million positions in a second, would in ''brute-force'' technic need 5 * 10 on 19 seconds, or 1,59 * 10 on 112 years or 8,8 * 10 on 101 (88 followed by 100 zeros) times more time than the universe has existed so far to process all possible moves, which should then be stored somewhere and read during the game.
