Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How to build the *weakest* program

Author: Omid David

Date: 11:46:51 08/20/02

Go up one level in this thread


On August 20, 2002 at 14:44:43, Albert Silver wrote:

>On August 20, 2002 at 14:36:54, Omid David wrote:
>
>>Change a few + and - signs in AlphaBeta search to choose the worst move at each
>>node :-) This will result in the *weakest* possible engine. Although stronger
>>programs will be able to find the worst moves more than others ;-)
>
>Nah. Just change the values to:
>
>Bishop = 1
>Knight = 1
>Rook = 1
>Queen = 1
>Pawn = 12
>
>And watch it sac all of its pieces for pawns at the first opportunity.
>
>                                        Albert

What you described results in a very poor program. What I suggested was a
sophisticated search algorithm to build the weakest possible program, so that no
one can ever lose to it ;-)



This page took 0.01 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.