Author: Steven Edwards
Date: 21:06:38 03/24/04
Symbolic: mini-progress report 2004.03.25 This is a mini progress report because there has been mini progress on Symbolic recently. Some items: 1. Symbolic is now a registered player at ICC and may also appear at FICS. However, I still need to write an interface and this will take a few weeks at the least. And it will be months until it can play much better than randomly. 2. The ChessLisp MateIn2 recognizer turned out to work not quite as well as I hoped as it also recognized stalemating moves in addition to mate in two moves. Chalk up another point for the benefits of regression testing; Symbolic is now on a daily diet of thousands of EPD test positions. 3. The initial work on pattern instance generation has started. A long way to go on this one. 4. The narrative output has been improved slightly and also includes better position captions, PV display, and information on book move selection. A sample is appended below. The plan is to continue with the simple pattern instance work with the intermediate goal of getting a reasonable non-search tactical exchange analysis (both evaluation and a confidence factor). -------- Greetings. This is Symbolic release 2004.03.24. I've started the selection process at 2004.03.25 00:05:15. I created the search tree with it's root node and candidate set. There are thirty-two candidate moves available: (Ba3 Bb4 Bc5 Bd6 Bd7 Be7 Kd7 Ke7 Na6 Nbd7 Nc6 Ne4 Nfd7 Ng4 Ng8 Nh5 Qd6 Qd7 Qe7 Rg8 a5 a6 b5 b6 c5 c6 dxc4 e5 g5 g6 h5 h6). The root position (The fourth move, Black to play): [D] rnbqkb1r/ppp2ppp/4pn2/3p4/2PP4/2N2N2/PP2PPPP/R1BQKB1R b KQkq - 1 4 I've selected the opening book move 4... c6. The resulting position occurs five hundred ninety-three times in my opening library. The scoring rate for this move is forty-six percent. The result position (The fifth move, White to play): [D] rnbqkb1r/pp3ppp/2p1pn2/3p4/2PP4/2N2N2/PP2PPPP/R1BQKB1R w KQkq - 0 5 I've selected the move 4... c6. No expectation is available. The predicted variation is: (4... c6). A total of 0.24 processor seconds were used for the selection. The search tree has one interior node, thirty-two leaf nodes, and thirty-three total nodes. My selection rate is one hundred thirty-seven nodes per second, and my average node time is seven milliseconds. I've ended the selection process at 2004.03.25 00:05:15.
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.