Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Definition of branching factor?

Author: Larry Griffiths

Date: 18:55:37 02/03/01

Go up one level in this thread


On February 03, 2001 at 18:26:21, Severi Salminen wrote:

>>I have not been able to get null move to work, but I will keep on trying.
>
>Here is a simple instruction:
>1. make sure you are not in check and you did not try null move in previous plye
>(it doesn't matter if you tried _2 plies_ before...)
>2. Switch sides (this is what makes this null move), clear en passant square.
>Remeber to update every variable the next ply needs for searching (things like:
>Firstmove[ply]...). That means every variably that gets normally updated in
>gen_moves(), for example.
>3. Now search with reduced depth. Increase ply counter and search :
>score=-search(a, b, d-1-R)
>4. If you get a fail high, return beta. Else continue searching this ply
>normally.
>
>I hope this cleared some things!
>Severi

It sounds like I can have several null moves going at one time.
Lets say that its whites move.
White does a null move, black cannot do a null move because white is doing one.
White gets to move again, but since black did not do a null move, white can do
another null move.

The search goes back to the first ply and Whites score is not >= beta, so it
continues and makes a move.  Black sees that white is no longer doing a null
move, so black makes a null move.  At the third ply, white cannot make a null
move because black is making a null move at the 2nd ply.

Am I way off base here ?

Larry.





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.