Computer Chess Club Archives

Search

Messages

Subject: Re: PV array

Author: Daniel Clausen

Date: 03:01:17 10/10/02

Go up one level in this thread

On October 10, 2002 at 05:49:41, Nagendra Singh Tomar wrote:

>Can anybody tell me why, almost all the chess program codes that I have seen use
>a bi-dimensional array for PV as in PV[256][256], even though only the first row
>is what that is used. In using so every time we update the PV we have to copy
>the PV[ply+1][*] to PV[ply][*]. In my engine I use a single dimensional array
>and it works fine. Is there any other aspect to it that I am missing.
>
>regds
>tomar

But you most likely have a single dimensional array as a local variable in
search  and therefore also have N of these arrays when you're N plies deep in
the search tree. And you also have to copy the moves when updating the PV.
Otherwise you either use a different search or just have a bug.

I use the "single dimensional array as local variable in search", since it seems
more intuitive to me. But that's just me.

Sargon

• Re: PV array Nagendra Singh Tomar 03:20:31 10/10/02
  • Re: PV array Daniel Clausen 03:43:20 10/10/02
  • Re: PV array Dieter Buerssner 03:40:50 10/10/02
    • Re: PV array Nagendra Singh Tomar 04:16:27 10/10/02
      • Re: PV array Dieter Buerssner 14:17:43 10/10/02
        • Re: PV array Peter Fendrich 14:51:17 10/10/02
          • Re: PV array Dieter Buerssner 15:22:16 10/10/02
            • Re: PV array Peter Fendrich 16:20:54 10/10/02
      • Re: PV array Sune Fischer 05:34:33 10/10/02
      • Re: PV array Richard Pijl 05:25:35 10/10/02
      • Re: PV array Carmelo Calzerano 05:17:10 10/10/02
        • Re: PV array Nagendra Singh Tomar 05:46:10 10/10/02

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.