Numberlink

A simple example of a Numberlink puzzle
Solution to the Numberlink puzzle

Numberlink is a type of logic puzzle involving finding paths to connect numbers in a grid.

Rules

The player has to pair up all the matching numbers on the grid with single continuous lines (or paths). The lines cannot branch off or cross over each other, and the numbers have to fall at the end of each line (i.e., not in the middle).

It is considered that a problem is well-designed only if it has a unique solution[1] and all the cells in the grid are filled, although some Numberlink designers do not stipulate this.

History

In 1897, a slightly different form of the puzzle was printed in the Brooklyn Daily Eagle, in a column by Sam Loyd.[2] Another early, printed version of Number Link can be found in Henry Ernest Dudeney's book Amusements in mathematics (1917) as a puzzle for motorists (puzzle no. 252).[3] This puzzle type was popularized in Japan by Nikoli as Arukone (アルコネ, Alphabet Connection) and Nanbarinku (ナンバーリンク, Number Link). The only difference between Arukone and Nanbarinku is that in Arukone the clues are letter pairs (as in Dudeney's puzzle), while in Nanbarinku the clues are number pairs.

As of 2006, three books consisting entirely of Numberlink puzzles have been published by Nikoli.

Versions of this known as Wire Storm, Flow Free and Alphabet Connection have been released as apps for iOS, Android and Windows Phone.[4][5][6][7][8][9]

Computational complexity

As a computational problem, finding a solution to a given Numberlink puzzle is NP-complete.[10] NP-completeness is maintained even if "zig-zag" paths are allowed. Informally, this means paths may have "unnecessary bends" in them (see the reference for a more technical explanation).[11]

See also

References

  1. ↑ Thomas Snyder (19 November 2010). "Dr. Sudoku Prescribes: Numberlink Puzzles". Wired. Retrieved November 23, 2010.
  2. ↑ Pegg, Jr., Ed (2007). "Beyond Sudoku" (PDF). Mathematica Journal. 10 (3): 469–73. Retrieved 11 September 2011.
  3. ↑ Dudeney, Henry (1917). "Problem 252 – A Puzzle for Motorists". Amusements in mathematics. Thomas Nelson.
  4. ↑ http://www.wire-storm.com
  5. ↑ https://itunes.apple.com/us/app/flow-free/id526641427?mt=8
  6. ↑ https://play.google.com/store/apps/details?id=com.bigduckgames.flow
  7. ↑ https://itunes.apple.com/us/app/alphabet-connection-arukone/id560852073?mt=8
  8. ↑ https://play.google.com/store/apps/details?id=com.skyler.konekt.android
  9. ↑ https://www.microsoft.com/en-gb/store/p/flow-free/9wzdncrfj3hr
  10. ↑ Kotsuma, Kouichi; Takenaga, Yasuhiko (March 2010), "NP-Completeness and Enumeration of Number Link Puzzle", IEICE technical report. Theoretical foundations of Computing, 109 (465): 1–7
  11. ↑ Adcock, Aaron; Demaine, Erik D.; Demaine, Martin L; O’Brien, Michael P.; Villaamil, Fernando S{\'a}nchez; D. Sullivan, Blair (October 23, 2014), "Zig-Zag Numberlink is NP-Complete", Journal of Information Processing, 23 (3): 239–245
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.