Hashiwokakero
Hashiwokakero (橋をかけろ Hashi o kakero; lit. "build bridges!") is a type of logic puzzle published by Nikoli.[1] It has also been published in English under the name Bridges or Chopsticks (based on a mistranslation: the hashi of the title, 橋, means bridge; hashi written with another character, 箸, means chopsticks). It has also appeared in The Times under the name Hashi. In France, Denmark, the Netherlands, and Belgium it is published under the name Ai-Ki-Ai.
Rules
Hashiwokakero is played on a rectangular grid with no standard size, although the grid itself is not usually drawn. Some cells start out with (usually encircled) numbers from 1 to 8 inclusive; these are the islands. The rest of the cells are empty.
The goal is to connect all of the islands by drawing a series of bridges between the islands. The bridges must follow certain criteria:[2]
- They must begin and end at distinct islands, travelling a straight line in between.
- They must not cross any other bridges or islands.
- They may only run orthogonally (parallel to the grid edges).
- At most two bridges connect a pair of islands.
- The number of bridges connected to each island must match the number on that island.
- The bridges must connect the islands into a single connected group.
Solution methods
Solving a Hashiwokakero puzzle is a matter of procedural force: having determined where a bridge must be placed, placing it there can eliminate other possible places for bridges, forcing the placement of another bridge, and so on.
An island showing '3' in a corner, '5' along the outside edge, or '7' anywhere must have at least one bridge radiating from it in each valid direction, for if one direction did not have a bridge, even if all other directions sported two bridges, not enough will have been placed. Obviously, a '4' in a corner, '6' along the border, or '8' anywhere must have two bridges in each direction. This can be generalized as added bridges obstruct routes: a '3' that can only be travelled from vertically must have at least one bridge each for up and down, for example.
It is common practice to cross off or fill in islands whose bridge quota has been reached.[2] In addition to reducing mistakes, this can also help locate potential "short circuits": keeping in mind that all islands must be connected by one network of bridges, a bridge that would create a closed network that no further bridges could be added to can only be permitted if it immediately yields the solution to the complete puzzle. The simplest example of this is two islands showing '1' aligned with each other; unless they are the only two islands in the puzzle, they cannot be connected by a bridge, as that would complete a network that cannot be added to, and would therefore force those two islands to be unreachable by any others.
Any bridge that would completely isolate a group of islands from another group would not be permitted, as one would then have two groups of islands that could not connect. This deduction, however, is not very commonly seen in Hashiwokakero puzzles.
Determining whether a Hashiwokakero puzzle has a solution is NP-complete, by a reduction from finding Hamiltonian cycles in integer-coordinate unit distance graphs.[3] There is a solution using integer linear programming in the MathProg examples included in GLPK.
History
Hashiwokakero first appeared in Puzzle Communication Nikoli in issue #31 (September 1990), although an earlier form of the puzzle appeared in issue #28 (December 1989).
See also
References
- ^ Puzzle Cyclopedia, Nikoli, 2004. ISBN 4-89072-406-0.
- ^ a b Wanko, Jeffrey J. (2010), "Deductive Puzzling" (PDF), Mathematics Teaching in the Middle School, 15 (9): 524–529.
- ^ Andersson, Daniel (2009), "Hashiwokakero is NP-complete", Information Processing Letters, 109 (19): 1145–1146, doi:10.1016/j.ipl.2009.07.017, MR 2552932.