Jump to content
BrainDen.com - Brain Teasers
  • 0


Guest
 Share

Question

wo players take turns biting off pieces of m × n rectangular chocolate bar marked into unit squares. Each bite consists of selecting a unit square and biting off that square plus all remaining unit squares above and/or to its right. Also, each player wishes to avoid getting stuck with the lowest-left square which is poisonous...

Refer to the attached image.

Assuming the chocolate bar has more than one unit square, which player (first or second) has a winning strategy and why?

post-36453-037035600 1287991644.png

Link to comment
Share on other sites

7 answers to this question

Recommended Posts

  • 0

Hi...

its no matter howmany squares they are..

in all cases,,I`ll begin with the square which is diagonal to the yellow square,leaving the right side and the squares above( leaving only two raws).

and I´ll win easily after that,, i.e. if he`ll take the right,I`ll take the above,and vice verse.

Link to comment
Share on other sites

  • 0

is that the second player does not have a winning strategy.

I got this argument after observing the 2x2 game, where there is the only one good opening move.

If the second player had a strategy against all possible first-moves, then he has a strategy if I remove the single square opposite to the poisonous one - the right-uppermost square.

In this case, whatever he chooses in his winning strategy I could have already chosen instead of choosing the right-uppermost square and beat him.

So there's no "bulletproof" strategy for the second player.

is how I could win as a first player.

All I can see is that if I choose something from the left-most column or the lowest-most row, I enter a new smaller chocolate-bar game as the second player, which means I no longer have a strategy. So whatever my winning strategy could be, I can never leave a rectangular chocolate bar for the second player. This is a necessary but not sufficient condition to win.

Link to comment
Share on other sites

  • 0

Hi...

its no matter howmany squares they are..

in all cases,,I`ll begin with the square which is diagonal to the yellow square,leaving the right side and the squares above( leaving only two raws).

and I´ll win easily after that,, i.e. if he`ll take the right,I`ll take the above,and vice verse.

This strategy only wins if m=n. If both branches are different, the second player only have to do both equal to win.

Edited by :-)
Link to comment
Share on other sites

  • 0

I think you should clarify what the contest of the game is; in other words, it is unclear what the players must do to win. Otherwise, it is impossible to figure out the puzzle.

Not die?

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
 Share

  • Recently Browsing   0 members

    • No registered users viewing this page.
×
×
  • Create New...