Computer Chess Club Archives

Search

Messages

Subject: Re: Move Generation

Author: Guillaume MOYA

Date: 00:14:56 02/23/05

Go up one level in this thread

On February 22, 2005 at 13:18:17, Pallav Nawani wrote:

Okays,

I launched my program with the start position, to see how many nodes my program
goes through, and I got exactly 206.603 nodes (i.e. the full tree). It's without
moves order, so I suppose my alpha beta function is bug free. I will now look
forward to implement a quick and efficient move order.

Cheers,
Guillaume

>Have you checked the move make - unmake functions of your program to perfection?
>If not, this may help:
>http://homepages.caverock.net.nz/%7Epeter/perft.htm
>
>Best regards
>Pallav

• Re: Move Generation Dan Honeycutt 11:24:36 02/23/05
• Re: Move Generation Mathieu Pagé 08:26:47 02/23/05
  • Re: Move Generation Guillaume MOYA 00:20:27 02/24/05
    • Re: Move Generation Bo Persson 13:11:30 02/24/05
      • Re: Move Generation Dann Corbit 17:27:03 02/24/05

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.