Author: Pham Hong Nguyen
Date: 09:14:55 05/02/99
I saw in the "PV Search" message of Peter that PV code like this:
move PV[MAXPLY] [MAXPLY];
...
PV[ply][0] = bestmove of this node;
for (ix=1; PV[ply+1][ix-1] != 0; ix++)
PV[ply][ix] = PV[ply+1][ix-1]
PV[ply][ix] = 0;
I tried other way like this:
move PV[MAXPLY];
...
PV[ply] = bestmove of this node;
And I found that some time my code is better, some time is worse than first. So
It makes me very confusion which is the best.
Did I do some thing wrong? Could someone give me some suggestions?
Thanks in advance,
Pham Hong Nguyen
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.