Author: Andrew Dados
Date: 15:09:52 01/20/05
Go up one level in this thread
On January 20, 2005 at 10:51:26, chandler yergin wrote: Now. Lets play a game of chess. Hmm.... seems complicated: >"Wolfe grunted. One hundred and sixty-nine million, >five hundred and eighteen thousand, eight hundred and twenty-nine followed by >twenty-one ciphers. The number of ways the first ten moves, both sides, may be >played" (Stout 1983) Ok then... let's play a game of KQ vs KQP. Each side has at least about 25 possible moves; according to your reasoning after 10 moves for both sides it gives 335544320000000000000000000000000 possible games. After 40 moves we get about 1.267650600228229401496703205376e+130 distinct, possible games. 1.26e^130 That is more then teh atoms in our universe. NOW READ WITH COMPREHENSION: MORE GAMES THEN WE CAN EVER STORE OR REACH. KQ vs KQP is IMPOSSIBLE TO SOLVE!!! How then can my computer create a tablebase of KQPKQ in about 4 hours? How can it _solve_ KQPKQ? Ya follow? IMPOSSIBLE must be a scam. HOW CAN YOU REFUTE THAT??????? YOU CAN'T CAN YA? STOP SPEAKING FROM YOUR ARSE AND GET A LIFE ------ -andrew-
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.