zakarya/puzzles
1
0
Fork 0
mirror of git://git.tartarus.org/simon/puzzles.git synced 2025-04-21 16:05:44 -07:00
Code Issues Packages Projects Releases Wiki Activity

Mention NetWalk and update comment

Browse Source 
[originally from svn r5841]
This commit is contained in:
Jacob Nevins
2005-05-24 20:28:38 +00:00
parent 49fdcd1ed4
commit 5409c27b4f
1 changed files with 5 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
puzzles.but
View File

@ -286,12 +286,14 @@ missing. See \k{common-id} for more details on this.)
\i\cw{NETGAME.EXE} to avoid clashing with Windows's own \cw{NET.EXE}.) \i\cw{NETGAME.EXE} to avoid clashing with Windows's own \cw{NET.EXE}.)
I originally saw this in the form of a Flash game called \i{FreeNet} I originally saw this in the form of a Flash game called \i{FreeNet}
\k{FreeNet}, written by Pavils Jurjans. The computer prepares a \k{FreeNet}, written by Pavils Jurjans; there are several other
implementations under the name \i{NetWalk}. The computer prepares a
network by connecting up the centres of squares in a grid, and then network by connecting up the centres of squares in a grid, and then
shuffles the network by rotating every tile randomly. Your job is to shuffles the network by rotating every tile randomly. Your job is to
rotate it all back into place. The successful solution will be an rotate it all back into place. The successful solution will be an
entirely connected network, with no closed loops. \#{Is it also true entirely connected network, with no closed loops. \#{The latter
that a correct solution will not contain any cycles?} As a visual aid, clause means that there are no closed paths within the network.
Could this be clearer? "No closed paths"?} As a visual aid,
all tiles which are connected to the one in the middle are all tiles which are connected to the one in the middle are
highlighted. highlighted.