Author: José Carlos
Date: 04:30:50 08/30/99
Well, I'm back from my summer holydays. Hello to everyone. I've been working hard on my program this summer and, finally, it plays chess (not very good chess, but chess at least). I'll distribute it freeware to everyone that ask me. Now I'm trying to make it Winboard compatible, wich maybe will take a couple of days (it depends on how quickly I finish to clean my house... :)). I have a couple of questions. 1) What is the standard way of counting nodes? (I think this question has been treated here, could somebody please tell me the results of that thread?). I actually print generated moves, visited nodes, and evaluated nodes. What do most programs print (for I can compare my speed)? 2) I've tried to implement PV Search (I think this is the correct name for the search where I use a null window for the non-PV moves) but my problem is, when I call QSearch, I have a null Alfa-Beta window, so QSeach doesn't work properly. I've tried calling QSearch with Alfa,+INFINITY. That works, but it's slow. What should I do? Thanks in advance. José C.
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.