Computer Chess Club Archives

Search

Messages

Subject: MTD(f), Quiscient Search, and hashing Quiscient nodes

Author: Joel

Date: 06:08:51 01/19/03

Hello All,

Just finished writing a simple Quiscient Search function, using MVV/LVA...

Now, previously my engine was using MTD(f) to power it. This obviously relies
heavily on the transposition table for good performance.

So this brings me to the question of hashing Quiscient nodes. I would like to
know what the generally accepted thing to do is?

Btw, I am really envious of everyone who has an engine thats able to compete in
CCT5. Hopefully mine will be in an acceptable state next time round. :)

Thanks,
Joel

• Re: MTD(f), Quiscient Search, and hashing Quiscient nodes Walter Faxon 11:11:34 01/20/03
  • Re: MTD(f), Quiscient Search, and hashing Quiscient nodes Joel 19:36:01 01/21/03
• Re: MTD(f), Quiscient Search, and hashing Quiscient nodes Andrew Williams 07:50:53 01/19/03
  • Re: MTD(f), Quiscient Search, and hashing Quiscient nodes Joel 07:59:46 01/19/03
    • Re: MTD(f), Quiscient Search, and hashing Quiscient nodes Andrew Williams 10:48:55 01/19/03
      • Re: MTD(f), Quiscient Search, and hashing Quiscient nodes Omid David Tabibi 10:56:22 01/19/03
        • Re: MTD(f), Quiscient Search, and hashing Quiscient nodes Andrew Williams 01:47:10 01/20/03

This page took 0.01 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.