Author: Uri Blass
Date: 04:31:06 12/26/01
read?
The problem is that I am interested to look at the tree that
my program generates and looking at the tree with
no graphics interface takes time.
I am interested in a program that gets every new node in
the tree that my program generates and put
it in a text file.
The program should get as an input every time
the following text:
1)a move for example e2e4 or e8g8 for castling
2)the distance of the move from the root in plies
3)comments after the nodes
anopther option should be to get instead of 1 and 2
simply a possible line from the root position
for example e2e4 e7e5 g1f3 b8c6 f3e5
using this option may be important if II want only to look at
nodes 100000-101000 and node 100000 is already based
on some plies after the root
The program should give a pgn file that the chessbase
interface knows to read with comments
Here is an example for a possible pgn that the program shuld
give after the right input(I do not care about the event site
and date information).
[Event "wac11"]
[Site "Tel-aviv"]
[Date "2001.12.25"]
[Round "?"]
[White "Uri"]
[Black "?"]
[Result "*"]
[SetUp "1"]
[FEN "r1b1kb1r/3q1ppp/pBp1pn2/8/Np3P2/5B2/PPP3PP/R2Q1RK1 w kq - 0 1"]
[PlyCount "3"]
[EventDate "2001.12.25"]
{64MB. URI-PC} 1. Qxd7+ {0} (1. a3 Qxd1 (1... bxa3 2. Qxd7+ (2. bxa3 Qxd1 (2...
Bxa3 3. Qxd7+ Nxd7 (3... Bxd7 4. Rxa3) (3... Kxd7 4. Rxa3) 4. Rxa3 (4. Bxc6)
4... Nxb6) 3. Bxd1 (3. Rfxd1 Bxa3 4. Rxa3) 3... Bxa3 4. Rxa3) 2... Nxd7 (2...
Bxd7 3. bxa3 (3. Rxa3) (3. Bxc6) 3... Bxa3 4. Rxa3) (2... Kxd7 3. bxa3 Bxa3 4.
Rxa3) 3. Bxc6 (3. Rxa3 Bxa3) 3... axb2 4. Bxa8 (4. Bxd7+ Bxd7) (4. Nxb2) 4...
b1=Q {qsearch is limited so the line end here}) 2. Bxd1 (2. Raxd1 bxa3 3. bxa3
Bxa3 4. Bxc6+) (2. Rfxd1) 2... bxa3 3. bxa3 Bxa3 4. Rxa3) (1. b3 Qxd1 2. Rfxd1)
(1. c3 Qxd1 (1... bxc3 2. Qxd7+ Nxd7 (2... Bxd7 3. Nxc3) (2... Kxd7 3. bxc3) 3.
bxc3 Nxb6 4. Nxb6) 2. Rfxd1 bxc3 3. bxc3) (1. c4 Qxd1 (1... bxc3 2. Qxd7+ Nxd7
(2... Bxd7 3. Nxc3) (2... Kxd7 3. bxc3) 3. bxc3 Nxb6 4. Nxb6) 2. Rfxd1) (1. g3)
(1. g4) (1. h3) (1. h4) (1. Nc3 Qxd1 2. Rfxd1 (2. Raxd1 bxc3) 2... bxc3) 1...
Nxd7 (1... Bxd7 2. Bxc6 Bxc6) (1... Kxd7) 2. Bxc6 *
Uri
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.