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

Home > Games
MineSweeper (Posted on 2009-02-16) Difficulty: 2 of 5
Info about MineSweeper

Assuming that you know about the Mine Sweeper game, find where mines can be in the following two scenarios:

1)
S S S S S
S 1 2 1 S
S X X X S

2)
S S S S S S
S 1 2 2 1 S
S X X X X S

Find for which 'n' values the following scenario is solvable for mines, where n represents the number of 2's.

S S S ........ S S S
S 1 2 ........ 2 1 S
S X X ........ X X S

In the above scenarios, S can be filled with a mine or a number and X can be filled only with a number.

No Solution Yet Submitted by Praneeth    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: solution Comment 2 of 2 |
(In reply to solution by Dej Mar)

Woah i must disagree with your 3rd paragraph. shouldn't it be 3k+1.
  Posted by Puneeth on 2009-07-25 07:02:22

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

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