Tree Puzzle 1.0.0

Written by Samuel E. Moelius III, August 26, 2006.

Win32 version packaged with Nate Robins' GLUT for Win32.


Distribution and Copyright Notices
----------------------------------

Tree Puzzle 1.0.0 is not in the public domain, but is freely distributable without licensing fees.

GLUT for Win32 (the file "glut32.dll") is Copyright 1997 by Nate Robins.  For distribution and copyright notices specific to GLUT for Win32, see the file "glut-README-win32.txt".


Running the Application
-----------------------

Mac version: Double click the icon for the file "Tree Puzzle 1.0.0".

Win32 version: Make sure that the file "glut32.dll" is in the same directory as the file "tree_puzzle_100.exe".  Then, double click the icon for the file "tree_puzzle_100.exe".


Instructions
------------

The object is to connect the vertices (boxes) so as to form a tree (i.e., a graph with no cycles) such that each vertex participates in as many additional edges as the number appearing inside of that vertex.  Two vertices can share an edge only if they are N-S or E-W neighbors.  So, for example, a vertex in which a '4' appears is a giveaway since it must share an edge with each of its four neighbors.

Edges are added to the graph by clicking between the vertices.  The application will not allow you to introduce a cycle into the graph, nor will it allow you to add an edge to a vertex in which a '0' appears.

When the puzzle is solved, the '>|' (fifth from the left) button becomes enabled, allowing you to proceed to a new puzzle.  Each puzzle has a unique solution.

Note that the connected components are colored so as to make them easier to distinguish.  The colors have no other significance.


Advanced Play
-------------

With the "Advanced Play" option checked, some vertices may appear blank, i.e., contain no number.  The application gives you the "freedom" to add any number of edges to such vertices.

At first, this "freedom" might make playing with this option sound easier.  However, this "freedom" actually makes finding the single, unique solution harder.


Buttons
-------

The functions of the buttons, in the order in which they appear, are as follows.

<<  Undo all moves.

<   Undo one move.

>   Redo one move.

>>  Redo all moves.

>|  Proceed to a new puzzle.  This button is enabled only when the current puzzle is solved.

.   Quit.


How To Contact The Author
-------------------------

Please send bug reports, suggestions for improvements, and/or comments, generally, to:

    moelius@cis.udel.edu

Any and all feedback is welcomed.