[Bug-gnubg] [Fwd: gnubg search function]

[Øystein Johansen]

>From: Thomas Hauk <address@hidden>
>To: info <address@hidden>
>Subject: gnubg search function
>
>I am interested in modifying the gnu backgammon code to implement a new
>search routine that should be exponentially faster than brute force
>search. I have two questions
>
>1) Do you have "stable" releases? I want to work with code that is
>"stable" but all I can find is your CVS repository as well as daily
>snapshots of it.

You can get the stable release though the cvs. Type:

cvs -d:pserver:address@hidden:/cvsroot/gnubg login
cvs -z3 -d:pserver:address@hidden:/cvsroot/gnubg co -r
pre-rel-0-13-0

>2) Where does the current search function hide? I'm told gnubg just
>performs a 1-ply full-tree search. Is this a part of eval.c? It's a huge
>file. Can you help point me toward the function?

The search functions are all hidden in eval.c. It's implemented as a recusive
function. See EvaluatePositionCubeful3, EvaluatePositionCubeful4,
EvaluatePosition, EvaluatePositionFull and EvaluatePositionCache.

Can you tell us a bit more about your search routine?

-Øystein