top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration Why to Join

    Get Free Puzzle Updates

Facebook Login
Site Registration

Develop a strategy for the player making the first turn, such he/she never looses the game?

0 votes
32 views

Consider a two player coin game where each player gets turn one by one. There is a row of even number of coins, and a player on his/her turn can pick a coin from any of the two corners of the row. The player that collects coins with more value wins the game. Develop a strategy for the player making the first turn, such he/she never looses the game?

Note that the strategy to pick maximum of two corners may not work. In the following example, first player looses the game when he/she uses strategy to pick maximum of two corners.

Example
  18 20 15 30 10 14
First Player picks 18, now row of coins is
  20 15 30 10 14
Second player picks 20, now row of coins is
  15 30 10 14
First Player picks 15, now row of coins is
  30 10 14
Second player picks 30, now row of coins is
  10 14
First Player picks 14, now row of coins is
  10 
Second player picks 10, game over.

The total value collected by second player is more (20 + 
30 + 10) compared to first player (18 + 15 + 14).
So the second player wins. 
posted Jul 29, 2017 by Sahana

Looking for solution? Promote on:
Facebook Share Button Twitter Share Button Google+ Share Button LinkedIn Share Button Multiple Social Share Button




Similar Puzzles
0 votes

Suppose two player, player A and player B have the infinite number of coins. Now they are sitting near a perfectly round table and going to play a game. The game is, in each turn, a player will put one coin anywhere on the table (not on the top of coin already placed on the table, but on the surface of the table). And the player who places the last coin on the table will win the game. Given player A will always move first. Suggest a strategy such that player A will always win, no matter how player B will play?

0 votes

Atul and Bhola are prisoners. The jailer have them play a game. He places one coin on each cell of an 8x8 chessboard. Some are tails up and others are heads up. Bhola cannot yet see the board. The jailer shows the board to Atul and selects a cell. He will allow Atul to flip exactly one coin on the board. Then Bhola arrives. He is asked to inspect the board and then guess the cell selected by the jailer. If Bhola guesses the correct cell among 64 options, Atul and Bhola are set free. Otherwise, they are both executed. Is there a winning strategy for Atul and Bhola? (They can co-operate and discuss a strategy before the game starts).

0 votes

All the rivers are magical, moment a worshiper crosses a river with any number of flowers, it becomes double. (For eg 1 flower becomes 2 flowers, 2 become 4 and so on).

How many minimum number of flowers a worshiper needs to carry from beginning such that he offers equal number of flowers in all the three temples, and he is left with zero flowers at the end of fourth river.

0 votes

You are stuck on an island where you have nothing. You find four pieces of paper somewhere on the island.

What will be your strategy to escape from the island safely?

PS: No other resource is available to you on the island, neither can you build anything.

+1 vote

Distance between the towns A and B is 1000 miles. There is 3000 mango's in A, and the mango's have to be delivered to B. The available car can take 1000 apples at most. The car driver has developed an addiction to mango: when he has mango aboard he eats 1 mango with each mile made. Figure out the strategy that yields the largest amount of mango's to be delivered to B.

Contact Us
+91 9880187415
sales@queryhome.net
support@queryhome.net
#280, 3rd floor, 5th Main
6th Sector, HSR Layout
Bangalore-560102
Karnataka INDIA.
QUERY HOME
...