List of Skyscrapers variants

From WPC unofficial wiki
Jump to navigation Jump to search

This page lists Skyscrapers variant that has appeared on the WPCs. Roland Voigt's website has a gigantic list of Skyscrapers variations. The variants are listed loosely in a chronological order of their invention.

Skyscraper Sums[edit]

Skyscraper Sums Example.png Skyscraper Sums Example Solution.png

Invented by Tim Peeters (Netherlands) in 1999.[1]

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. The numbers outside the grid indicate the sum of the heights of the skyscrapers that can be seen in the respective row or column from the respective direction.

(Example from PGP IB)

Mixed Information[edit]

Hybrid with Easy as puzzle. Earliest example found is in 24hPC 2007, written by Bernhard Seckinger (Germany).

Skyscrapers Mixed Information Example.png Skyscrapers Mixed Information Example Solution.png

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. The numbers outside the grid indicate either how many skyscrapers can be seen in the respective row or column from the respective direction, or the first skyscraper in the respective row or column, or possibly both.

(Example from WPC 2019 IB)

Skyscraper Cluster[edit]

First appeared on LMD portal in 2010. Invented by Christian Halberstadt (Germany).

Skyscrapers Cluster Example.png Skyscrapers Cluster Example Solution.png

Enter numbers into the grid, so that each region of size N×N contains numbers from 1 to N, and within a region each number appears exactly once in each row and column. These numbers represent skyscrapers of the corresponding height. Numbers bordering another grid are also clues for the adjacent grid, they indicate how many skyscrapers can be seen in the respective row or column from the respective direction. However, only clues in cells with circles are correct, clues in grey cells are always incorrect. If a corner cell borders two different grids, its clue number must be correct for both adjacent grids if the cell contains a circle, or incorrect for both adjacent grids if the cell is grey. Numbers outside the grid are correct clues for the adjacent grid.

All clue numbers refer only to the adjacent grid, only visible skyscrapers in the adjacent grid are counted.

(Rules and example from WPC 2019 IB)

Doppelblock Skyscrapers[edit]

See Doppelblock#Doppelblock_Skyscrapers.

With Mirrors[edit]

Skyscrapers with Mirrors Example.png Skyscrapers with Mirrors Example Solution.png

The first ruleset (see below) can be seen on the 13th 24 Hours Puzzle Championship (2012). The other two first appeared on WPC 2018/Round 2. All puzzles were written by Jiří Hrdina (Czech Rep.). A set of 3 slightly different rulesets were published under the same name.

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. Additionally, one diagonal mirror is placed in each row and column. Sight is vertically reflected by mirrors.

3 slightly different rules regarding placement of mirrors were presented. Namely,

  • Mirrors are already given.
  • Only the positions of the mirrors are given but its orientation are unknown.
  • Both the positions and the orientations are unknown.

(Example (first ruleset) from WPC 2018 IB)

Inside Skyscrapers[edit]

Different variants with this name exist.

No arrows[edit]

Inside Skyscrapers Example.png Inside Skyscrapers Example Solution.png

First appeared on 2012 Indian Nationals.[2] Author of the puzzle was Deb Mohanty (India).

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. The clues on the edges between some cells indicate the number of skyscrapers visible in corresponding row or column from that point.

(Example from WPC 2017 IB)

Skyscrapers^2[edit]

Skyscrapers^2 Example.png Skyscrapers^2 Example Solution.png

This name was given when Prasanna Seshadri (India) invented the puzzle for WPC 2017. However, independently Christian Halberstadt (Germany) also thought of the same rules and posted the puzzle in the LMD portal under the title Kleine Hochhausserie: Hoch angesehene Hinweise ("Small Skyscrapers series: height-overlooking clues"). [3]

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. The clues on the edges between some cells indicate the number of skyscrapers visible in corresponding row or column.

Numbers beside diagonal lines indicate the number of skyscrapers seen considering skyscraper clues in a line in the corresponding direction. It may be part of solving to use the missing skyscraper clues.

(Example from WPC 2017 IB)

With GT Hints[edit]

Skyscrapers with GT Hints Example.png Skyscrapers with GT Hints Example Solution.png

First appeared on WPC 2018/Round 2.

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. In each row/column, relation between the number of visible bulding and the height of the first seen building is given.

(Example from WPC 2018 IB)

Skyscrapers / As Easy As ABC[edit]

Skyscrapers As Easy As ABC Example.png Skyscrapers As Easy As ABC Example Solution.png

First appeared on WPC 2018/Round 2. Hybrid with Easy as Rules.

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. Some cells remain empty. The numbers indicate the sum of the numbers of visible buildings and the first building seen.

(Example from WPC 2018 IB)

Myopia[edit]

Skyscrapers Myopia Example.png Skyscrapers Myopia Example Solution.png

First appeared on WPC 2018/Round 2. Hybrid with Myopia arrows.

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. The arrows in the cells indicate all the directions from which the most number of buldings can be seen.

(Example from WPC 2018 IB)

With Glass Towers[edit]

Skyscrapers with Glass Towers Example.png Skyscrapers with Glass Towers Example Solution.png

First appeared on WPC 2018/Round 2.

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. One building in each row and column is invisible. You have to decide where the invisible buildings are.

(Example from WPC 2018 IB, invisible buildings are indicated by grey cells)

Stroll among Skyscrapers[edit]

Stroll among Skyscrapers Example.png Stroll among Skyscrapers Example Solution.png

First appeared on WPC 2018/Round 2.

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. The numbers in the grey cells indicate the number of visible skyscrapers in the direction of the arrow. There are no buildings in the grey cells.

(Example from WPC 2018 IB)

First Invisible[edit]

Skyscrapers First Invisible Example.png Skyscrapers First Invisible Example Solution.png

First appeared on WPC 2018/Round 2.

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. The numbers outside indicate the first invisible skyscrapers from the given direction.

(Example from WPC 2018 IB)

With Sum Baskets[edit]

Skyscrapers with Sum Baskets Example.png Skyscrapers with Sum Baskets Example Solution.png

First appeared on WPC 2018/Round 2.

Place a number from 1 to N into each cell so that each number appears exactly once in each row and column. Each number represents a skyscraper of its respective height. The numbers outside the grid indicate how many skyscrapers can be seen in the respective row or column from the respective direction. For each outlined regions, the sum of the heights of the skyscrapers in the region is given. (This is different from Killer rules because of the absence of non-repeating rule in regions)

(Example from WPC 2018 IB)

Double Skyscrapers[edit]

Double Skyscrapers Example.png Double Skyscrapers Example Solution.png

First appeared on WPC 2018/Round 10. Written by Jiří Hrdina (Czech Rep.).

Place a number from 1 to N into each cell of the two empty grids, so that each number appears exactly once in each row and column of each grid. Each number represents a skyscraper of its respective height. The numbers outside the third grid indicate total number of skyscrapers that can be seen in the respective row or column from the respective direction in each of the grids.

Rule Variation[edit]

  • In one of the puzzles in WPC 2018/Round 10, there was an additional rule that states skyscraper heights in the corresponding cells add up to 6. (N=5)

Appearances in the past WPCs[edit]

References[edit]

  1. ↑ http://www.oocities.org/kostunix/oldindex.html
  2. ↑ https://logicmastersindia.com/lmitests/?test=IPC2012
  3. ↑ https://logic-masters.de/Raetselportal/Raetsel/zeigen.php?chlang=de&id=0001TM
Retrieved from "https://wpcunofficial.miraheze.org/w/index.php?title=List_of_Skyscrapers_variants&oldid=1985"