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.

Woah i must disagree with your 3rd paragraph. shouldn't it be 3k+1.

Posted by Puneeth on 2009-07-25 07:02:22