Computer Chess Club Archives


Search

Terms

Messages

Subject: Search tree visualization with treemaps

Author: Rémi Coulom

Date: 06:02:39 08/26/01


Take a look at:
http://www.cs.umd.edu/hcil/treemaps/

I used this technique once to write a piece of software for the visualization of
disk usage of a large file system. I have thought for a long time that it would
be nice to use it to navigate the huge search trees generated by my chess
program. I have just exported a search tree to the software I had written for
the visualization of file system hierarchies, and it really looks great. I feel
like the first time I used a profiler to optimize a program.

Unfortunately, I can not distribute this software I wrote (it belongs to my
former employer). I think I will make a new chess-specific one, anyway, and
distribute it as freeware. If you want to have a feel of it, though, you can
download this program:
http://www.cs.umd.edu/hcil/treemaps/treemap97.shtml
Some very nice java demos are also available there:
http://www.columbia.edu/~mmw111/treemap/
I am really enthusiastic about this technique. I have tons of ideas for search
tree visualization. In particular I think it can be a great tool to analyze the
difference between two search trees, with different selectivity or move ordering
heuristics, or even between two different programs.

I will keep you informed of my progress with this idea.

Rémi



This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.