(redirected from FreeNet)



A highly addictive Flash puzzle game consisting of a power source with one to three outlets, a series of "wires" of three shapes (L, I, and T), and a bunch of devices, all laid out on a rectangular grid. Essentially, route power from the power source, through all of the wires, to the devices by rotating the different squares of the grid. The game has a similar mentality to Minesweeper in that if you know that a certain square must have a particular orientation, then it follows that other grids must have known orientations as well. However, Net has more complex logic chains, no "death", and an annoying piano song that can fortunately be turned off. Also reminiscent of PipeDream?, but with no time pressure except for its influence on score.

There are two different forms of the game (discounting the grid size variations): non-wrapping and wrapping walls. In the former version, all of the walls are solid barriers, which makes the game for the most part not too difficult. The number of orientations you can lock down at the beginning of the game is fairly large (for example, if you ever see three devices, or two devices and a wall lined up next to each other, then you know the middle one points toward the interior of the grid). This version of the game, of course, nets (heh) you a lower HighScore. In the latter version, connections can be formed across the edges of the grid; essentially the grid is toroidal. Typically you only get a few locked orientations at the start and you need to use all of them, whereas in the non-wrapping form you can probably start anywhere with good success rates.

Sounds like a more sophisticated version of [NetWalk] from [Gamos].

I suppose if we like, we can put some standard deductions here. Might as well add some content to the page.

  |      |
 -+--*  -+  *
         |  |
         |  |
  *--+-  *  +-
     |      |

Random question: How does scoring work? Taking 13:40 on a max-size grid with wrapping walls and making 107 moves when 106 were necessary (read: accidentally clicked on the wrong I-shaped wire) nets 449,926 points. Presumably making no mistakes is worth more than working quickly, but are more complicated grids worth more points? In other words, to achieve a maximal high score, must one find a grid where all 143 squares are out of position and then click through them in record time?

I now present, for your edification and enlightenment, the scoring algorithm for the game.

Let n be 0 if you finish the game in the "minimum" number of moves or less. Otherwise, let it be the number of extra moves you required. Let x be the "minimum" number of moves. Let y be the number of seconds it took you to finish the puzzle, if its at least x, otherwise let it be x. Let M be the total number of squares in the grid. Then your score will be the greatest integer less than (1/(n+1)+x/y)*M*5000. At least, this works for every example I have tried; let me know if you find exceptions.

FunWiki | RecentChanges | Preferences
Edit text of this page | View other revisions
Last edited December 25, 2003 21:32 (diff)