Author: Rémi Coulom
Date: 15:49:33 09/23/01
Hi all, I wrote an article a few days ago about this idea. I have implemented a small utility and it starts to give great results. I thought you'd like to take a look at some screenshots. The first one is the visualization of a search tree from the starting position. Colors indicate fail high/low and bad move ordering (searching green areas could have been avoided with a better move ordering). Note that it is not The Crazy Bishop that generated such a ugly tree but my "simple" chess engine. http://remi.coulom.free.fr/treemap.png The second one is a view of an opening book: http://remi.coulom.free.fr/bookmap.png I really love this tool. It makes it a pleasure to browse huge search trees. One of the other nice things it can do is a graphical diff between two search trees. And I am sure it can have tons of uses that I cannot imagine yet. I think I will release this visualization tool whithin a few days. It can read PGN files. Flags such as "fail high", "hash table move", ... can be indicated in the NAG. The SAN notation for the null move is "null". This way, any program than can produce a PGN file of its search tree will be able to have it visualized like above. The function to diff two search trees is also built-in. Rémi
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.