Author: Odd Gunnar Malin
Date: 14:05:59 04/28/02
Go up one level in this thread
On April 28, 2002 at 16:26:18, Russell Reagan wrote: >I'm curious why a triangular array is needed when storing the PV. What is wrong >with having a regular array that stores the PV? In other words... > >move pv[MAX_PLY][MAX_PLY]; // <--- why do we need this? >move pv[MAX_PLY]; // <--- instead of just this? > >Since you only use pv[0][0], pv[0][1], pv[0][2], etc. I don't see why you can't >use a one demensional array to store the pv in. There must be some reason >because when I searched the net and the CCC archives everyone explained it using >a triangular array, but I can't seem to figure out why this is necessary. Anyone >know the reasoning here? > >Russell Hi. You don't know before the search return that it would be a new PV, so you (at least I do) have to save PV for all rootmoves or current plus best. pv[MAX_MOVE][MAX_PLY] I can imagine that other do it different :) Also before I print out a pv I try to extend it with help of hashtable moves. Odd Gunnar
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.