All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Skyscraper Counting (Posted on 2009-03-16)
Consider a skyscraper problem on a 9x9 board. When a number is visible on the edge there will be some number of possible arrangements of buildings that could achieve this.

Find the number of possible arrangements of building if the edge number is each of {1,2,3,4,5,6,7,8,9}

For example on a 3x3 board there are three possibilities if a 2 is visible on the end (viewing from the left): (1,3,2), (2,3,1), (2,1,3)

(1,3,2), (2,3,1), (2,1,3)
What you would see:

 No Solution Yet Submitted by Jer No Rating

Comments: ( You must be logged in to post comments.)
 Subject Author Date analytic explanation of recursion formula Charlie 2009-03-16 16:04:41 solution Charlie 2009-03-16 13:31:56 9x9 grid and counts ed bottemiller 2009-03-16 12:45:57
Please log in:
 Login: Password: Remember me: Sign up! | Forgot password

 Search: Search body:
Forums (5)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information