Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Board games and mathematical complexity: a poll

Author: Vincent Diepeveen

Date: 09:32:56 12/11/02

Go up one level in this thread


On December 11, 2002 at 12:00:12, Edward Seid wrote:

You ask a very easy question.

Programming complexity is depending upon how difficult it is
to beat the competition of course. There is no other measure
than that.

There has been put so much commercial effort in chess
that beating the competition in chess is nearly impossible.

So that makes the ranking very easy:

- Chess
- Go    (at a huge distance from chess, these guys don't even know,
         and i am at their list, the difference between a program
         that's written by a human and a selflearning network; of course
         with exception of the commercial guys)
- Xiangqi (also commercial interests there; but their search is still poor)
- Shogi   (also some commercial interest in it, but so far the selective
           approaches i read for it are even below Uri Blass level)
- Othello (only amateurs are busy there)

>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.



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.