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

 Boosted board (Posted on 2012-02-07)
Consider an infinite chessboard. Each square contains either a 1 or an X in some pattern. (X can be any real number but for a given board, all the X's are the same.)

Each square with an X on it has weight equal to zero.
Each square with a 1 on it has a weight of 1 + N*X where N is the total number of X's on the 8 surrounding squares.

For a given value of X, find a way of tiling the board with the highest average weight per square.

Inspired by various Tower Defense games.

 See The Solution Submitted by Jer Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(2): Shaky ground? You misunderstand. | Comment 6 of 11 |
(In reply to re: Shaky ground? You misunderstand. by Jer)

Yes, upon reading Steve Herman I clearly did misunderstand.  I was looking at a "1" as having neighbouring "X"s somewhat akin to the solitaire "Minefield" game.
 Posted by brianjn on 2012-02-08 21:01:28

 Search: Search body:
Forums (0)