Author: Jesper Antonsson
Date: 13:30:44 12/11/02
Go up one level in this thread
On December 11, 2002 at 13:12:59, William H Rogers wrote: >On December 11, 2002 at 12:00:12, Edward Seid wrote: > >>Western Chess >>Shogi >>Go >>Xiangqi (Chinese Chess) >>Othello > >Based upon the strength of the programs written for the above games I can only >comment about three of them. Go, in my opinion and the opinion of many others is >the most complecated, followed by chess. Othello, on the other hand depends on >the roll of the dice which includes 'chance' and there for should not be compare >to the others. Are you thinking of backgammon? There are no dice or 'chance' whatsoever in Othello. >There are both Othello and Checkers programs that have defeated >the worlds champions many different times, so I would conclude that they have >been solved. This is not what most mean by "solved". Solved implies determining who wins, black or white, given optimal play. In ten to fifteen years, computers will be better than world champions in chess, but the game will be far from solved. >I still recall a tournement held in 2000 where one program defeated another >without ever leaving its opening book. I do not consider that a chess thinking >machine or program, just a look-up program that could not solve the problem >without is extensive books. A perfect database (32 men endgame tablebase), could it be constructed, would obviously contain the "solution" to chess. But the solution was constructed during tablebase construction, not while using them to play.
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.