Author: Robert Hyatt
Date: 16:32:37 12/12/02
Go up one level in this thread
On December 11, 2002 at 13:50:33, Vincent Diepeveen wrote: >On December 11, 2002 at 12:34:21, Bruce Cleaver wrote: > >>On December 11, 2002 at 12:00:12, Edward Seid wrote: >> >>>Please rank the following games in order of mathematical (programming) >>>complexity. Also, if you can, provide a degree of magnitude to quantify your >>>ranking. >>> >>>Western Chess >>>Shogi >>>Go >>>Xiangqi (Chinese Chess) >>>Othello >>> >>>Also, feel free to add any other games I didn't include. >> >>mathworld.wolfram.com has estimates of the # of legal positions for these games. >> Go is far and away the winner (10^170). Western Chess has about 10^43, and >>checkers maybe 10^21. Dunno about shogi. > >You talk about branching factor here. that has nothing to do with >how complex it is to beat the other programs. > >That was not the question. Here is the question: =====================quote on============================= Please rank the following games in order of mathematical (programming) complexity. Also, if you can, provide a degree of magnitude to quantify your ranking. =====================quote off============================= Why do _you_ try to change the question? It was asked clearly enough, with the "mathematical" reference. That's what _most_ have been answering. You are off in another world answering something that wasn't even asked...
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.