U-Bahn

From WPC unofficial wiki
Revision as of 22:44, 8 February 2021 by EctoPLASMA (talk | contribs) (I can't spell "Hungarian" gosh)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Rules[edit]

U-Bahn Example.png U-Bahn Example Solution.png

Draw the map of an underground railway into the grid. The map consists of horizontal and vertical lines connecting adjacent cells. All lines are interconnected, and there are no dead ends; some cells may remain unused. The numbers outside the grid indicate how many cells of a specific type (crossing, junction, straight line or curve, regardless of rotation) appear in the respective row or column.

(Rules and example from WPC 2019 IB)

History of the puzzle[edit]

The puzzle is probably of a Hungarian origin and dates back to at least 2005. It appeared on a playoff round of 2005 Hungarian Nationals.

Appearances in the past WPCs[edit]