Author: Rafael Andrist
Date: 12:13:14 12/28/01
Go up one level in this thread
On December 28, 2001 at 13:46:32, Uri Blass wrote: >It is a program that writes my chess tree as a pgn file in a language that Fritz >or Junior interface can understand. > >I already asked in another post if there is a free program that does it and got >no response. >The program may get every new legal move as a string(e2e4 or e8g8) >It can also get the depth of the node as a parameter and based on this >information it should generate a pgn file that Fritz interface can understand. The easiest and fastest way is to implement this in your program (directly into your recursive search function). Note that it will slow down your program. If you need it for debugging an unknown error, you may write each move directly to harddisk. This slowed my program down to 1/10 but was very useful to detect problems. Since your program is much faster, it run only with 1/100 of normal speed. If you don't need to detect errors and therefor don't write each move directly to harddisk the slowdown won't be so huge but still noticeable. >I believe that looking at the trees of my program can >help me to think about better ideas but I cannot imagine the position clearly >based only on the text of the moves and looking at the positions in Fritz's >interface can help me. >I have almost no experience with writing into text files in C and this is one of >the reason that I did not try to do the relevant program by myself and prefered >to concentrate on other things. its practically the same like writing text to stdout, use fprintf instead of printf regards Rafael B. Andrist
This page took 0.01 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.