Computer Chess Club Archives


Search

Terms

Messages

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

Author: Tord Romstad

Date: 12:43:16 12/11/02

Go up one level in this thread


On December 11, 2002 at 12:32:56, Vincent Diepeveen wrote:

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

While I agree that the difficulty of beating the competition is a good
measure of the programming complexity, I do not share your definition of
"the competition".  Is it not much more interesting to compete with the best
human players than with the best computer programs?

Tord Romstad



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.