Author: Peter Fendrich
Date: 04:56:23 02/10/99
Go up one level in this thread
On February 10, 1999 at 06:04:52, Viktor Popjuk wrote:
>please, I need some help.
>
>I'm writing my first chess program and i try implement null-move, but I'm not
>fully understand it.
>
>I write something like this:
>
>alphabeta(a,b,d)
>{
> if not in check and last_move not null_move
> then
> make null_move
> val = -alphabeta(-b,-a,d-1)
> unmake_move
>
> ??? what done here with val?
> ??? return if val >alpha+xxx?
> ??? and what return ?
>
> endif
>
> ...
> normal alphabeta
>
>}
>
>Thanks for any help.
>
>Viktor.
>
>
>Sorry for my bad english.
1) You should reduce the depth when searching the Nullmove
Try d-3 instead of d-1.
2) If my opponent can't improve his position after my Nullmove, I probably have
a killing position. So...
if val >= beta return beta (or val if you prefer)
//Peter
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.