From 6e8e5c5141cf8f754a1b468eb53ea91e494f97f7 Mon Sep 17 00:00:00 2001 From: jacob Date: Tue, 24 May 2005 20:28:38 +0000 Subject: [PATCH] Mention NetWalk and update comment git-svn-id: svn://svn.tartarus.org/sgt/puzzles@5841 cda61777-01e9-0310-a592-d414129be87e --- puzzles.but | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/puzzles.but b/puzzles.but index fa7ce1a..1faa9e8 100644 --- a/puzzles.but +++ b/puzzles.but @@ -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 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 shuffles the network by rotating every tile randomly. Your job is to rotate it all back into place. The successful solution will be an -entirely connected network, with no closed loops. \#{Is it also true -that a correct solution will not contain any cycles?} As a visual aid, +entirely connected network, with no closed loops. \#{The latter +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 highlighted. -- 2.11.0