Author: Uri Blass
Date: 09:19:37 04/02/04
Go up one level in this thread
On April 02, 2004 at 11:35:56, Steve Maughan wrote:
>Uri,
>
>>I want to have some general search code(not only for chess) when it will be
>>possible to implement failsoft,failhard,mtd and many search ideas by the >right defines.
>
>One small point - while many search ideas are portable to games other than chess
>there are some that don't work at all in other games. For example Null move
>will not work in Othello or Checkers where zugwag is a major component of the
>game. But I guess you'd just take that component out of such games,
>
>Thanks for the ideas,
>
>Regards,
>
>Steve
No problem
I have in the code that I posted:
"if (nullconditions(depth))"
In case that you do not want to use null move you may have
int nullconditions(depth)
{
return 0;
}
Even if null move at every node does not work in some games it does not mean
that it cannot work with the right nullconditions functions that often return 0
but not always.
I want structure that will help programmers to try different ideas in every
game.
Uri
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.