Problem 2026. Skyscrapers - Puzzle

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The Skyscraper puzzle challenge comes from</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://logicmastersindia.com/home/\"><w:r><w:t>Logic Masters India</w:t></w:r></w:hyperlink><w:r><w:t> and</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.conceptispuzzles.com/\"><w:r><w:t>Games' Concept is Puzzles</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Create an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> M an NxN matrix</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[vr=[0 0 3 0 0]';\nvL=[3 0 0 1 0]';\nvd=[0 0 0 0 0];\nvu=[5 2 0 0 0];\n\nM\n 5 4 2 1 3\n 4 5 1 3 2\n 3 2 4 5 1\n 2 1 3 4 5\n 1 3 5 2 4]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Algorithm Discussion:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]\n2) Calc Skyscraper count from Left and Right\n3) Determine subset of SkyVectors possible for each Row and Column\n4) Sort the Qty of 2*N possible solutions\n5) Recursion from least to most valid SkyVectors\n6) In recursion verify valid overlay or return]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

The Skyscraper puzzle challenge comes from <a href = "http://logicmastersindia.com/home/">Logic Masters India</a> and <a href = "http://www.conceptispuzzles.com/">Games' Concept is Puzzles</a>.Create an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.Input: [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)Output: M an NxN matrixExample:<pre class="language-matlab">vr=[0 0 3 0 0]';
vL=[3 0 0 1 0]';
vd=[0 0 0 0 0];
vu=[5 2 0 0 0];
</pre><pre class="language-matlab">M
 5 4 2 1 3
 4 5 1 3 2
 3 2 4 5 1
 2 1 3 4 5
 1 3 5 2 4
</pre>Algorithm Discussion:<pre class="language-matlab">1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]
2) Calc Skyscraper count from Left and Right
3) Determine subset of SkyVectors possible for each Row and Column
4) Sort the Qty of 2*N possible solutions
5) Recursion from least to most valid SkyVectors
6) In recursion verify valid overlay or return
</pre>

The Skyscraper puzzle challenge comes from <http://logicmastersindia.com/home/ Logic Masters India> and <http://www.conceptispuzzles.com/ Games' Concept is Puzzles>.

Create an NxN matrix where each row and column contains 1:N given the constraints of View_Right, View_Left, View_Down, and View_Up. A View is the number of Skyscrapers visible the given edge location. A Zero value is No Information provided.

*Input:* [vr,vL,vd,vu] vectors of sizes (N,1),(N,1),(1,N),(1,N)

*Output:* M  an NxN matrix

*Example:*

vr=[0 0 3 0 0]';
  vL=[3 0 0 1 0]';
  vd=[0 0 0 0 0];
  vu=[5 2 0 0 0];

M
         5     4     2     1     3
         4     5     1     3     2
         3     2     4     5     1
         2     1     3     4     5
         1     3     5     2     4

*Algorithm Discussion:*

1) Create permutations H and V vectors of length N of values 1:N. (N=5) [12345;12354;...54321]
  2) Calc Skyscraper count from Left and Right
  3) Determine subset of SkyVectors possible for each Row and Column
  4) Sort the Qty of 2*N possible solutions
  5) Recursion from least to most valid SkyVectors
  6) In recursion verify valid overlay or return

Solve

Solution Stats

10 Solutions
5 Solvers

Last Solution submitted on Oct 01, 2020

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers5

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 2026. Skyscrapers - Puzzle

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Problem 2026. Skyscrapers - Puzzle

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Players