Treemaps for Search-Tree Visualization
Rémi Coulom · 2002
Large Alpha-Beta search trees generated by game-playing programs are hard to represent graphically. This paper describes how treemaps can be applied to the visualization of these trees. The principle of treemaps is presented, and difficulties of its application to the particular structure of search trees are reviewed. An original "ordered squarified" layout is proposed. It has been implemented in a freely available program, that can be easily re-used by computer-chess programmers.