Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What is the thinking game that gives programmers more money?

Author: Robert Hyatt

Date: 21:45:03 06/07/02

Go up one level in this thread


On June 07, 2002 at 19:54:26, Gareth McCaughan wrote:

>On June 07, 2002 at 19:21:52, Russell Reagan wrote:
>
>> If chess were played on a 19x19 board with 38 pieces on each side,
>> it would be extremely more complex as well. The game of go is on
>> a complexity level of tic-tac-toe. If tic-tac-toe were played on
>> a 19x19 board it would be complex too. The only thing making go
>> a more difficult game to succeed at is the larger size of it's board.
>> So when I hear go players say that their game is so much harder,
>> it irritates me because it is not.
>
>So that the rest of us know how seriously to take these pronouncements,
>would you mind telling us your grading at go?
>
>By the way, tic-tac-toe on a 19x19 board is trivial. Gomoku (which
>is a little like a more complicated version of tic-tac-toe, played
>on a 19x19 board) is not trivial but is (1) much easier than chess
>and (2) solved by computers.
>
>--
>g


GO will take longer to solve than chess.  Why?  The game lasts for more
moves.  The branching factor is _much_ higher than chess making the trees
far more "bushy" and leading to far shallower searches than chess.

The "game" of GO is simpler than chess.  But the computational complexity
is far higher.  IE chess has too many different types of pieces, different
types of moves (promotions are a good example, as is castling and EP),
"exceptions" (first pawn move can be 1 or two squares, pawns advance forward
but capture diagonally) and so forth.  But the board is much smaller, which
makes it computationally much more tractable.



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.