Computer Chess Club Archives

Search

Terms

Messages

Subject: Crafty question: root iteration

Author: Sanjiv Karnataki

Date: 14:46:51 02/12/00

Hi All,

I was trying to put in MTD(f) in my amateur program, but it seemed to worsen the
search times so I decided to do what every amateur does when they get stuck ;) I
looked at Crafty's code to see if it did something similar, but I cannot figure
out what it is doing.

Could someone (possibly Dr. Hyatt) please explain in small words the logic in
iterate.c and searchr.c? I understand that it maintains a sorted root move list,
but I cannot understand all the stuff it is doing with root_alpha, root_beta,
root_moves[0].status. It also modifies root_beta in SearchRoot !?.

Any help is greatly appreciated, thank you in advance !

Sanjiv.

Re: Crafty question: root iteration Robert Hyatt 16:39:44 02/12/00
- Re: Crafty question: root iteration Sanjiv Karnataki 19:45:21 02/12/00
  - Re: Crafty question: root iteration Robert Hyatt 07:55:13 02/13/00

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.