Find the shortest sequence of moves that is to win the game, Game Theory

You and an opponent are seated at a table, and on the table is a square board. At each of the four corners of the board, there is a disc, each one red on one side and black on the other. You are blindfolded, and thus cannot see the configuration of the discs, but you claim that you can flip the discs such that they are all facing with the same color up. On each move, you can flip either one or two discs (either adjacent or diagonal to each other). If this results in a winning state, your opponent must announce that. Otherwise, your opponent may choose to rotate the board 0°, 90°, 180°, or 270°. Find the shortest sequence of moves that is guaranteed to win the game, no matter what rotations of the board are made. Be sure to include a proof that your solution is correct and that it is the shortest possible.

Posted Date: 4/1/2013 5:16:09 AM | Location : United States







Related Discussions:- Find the shortest sequence of moves that is to win the game, Assignment Help, Ask Question on Find the shortest sequence of moves that is to win the game, Get Answer, Expert's Help, Find the shortest sequence of moves that is to win the game Discussions

Write discussion on Find the shortest sequence of moves that is to win the game
Your posts are moderated
Related Questions
A common term for an English auction, a sort of sequential auction during which an auctioneer directs participants to beat the present, standing bid. New bids should increase the p

In econometric theory two possibie situations of identifiability can arise: Equation under,consideration is identified or not identified: 1) Equation is under-identified-

Scenario As described by William Poundstone, imagine that you just notice that electricity has gone out for your entire neighborhood. the electrical company can send somebody to

GAME 5 All-Pay Acution of $10 Everyone plays. Show the students a $10 bill, and announce that it is the prize; the known value of the prize guarantees that there is no winer’s

Two people are involved in a dispute. Person 1 does not know whether person 2 is strong or weak; she assigns probability to person 2 being strong. Person 2 is fully informed. Each



what will be the best strategy for a bidder in an auction comprised of four bidders?

Rollback equilibrium       (b) In the rollback equilibrium, A and B vote For while C and D vote Against; this leads to payoffs of (3, 4, 3, 4). The complete equil

In many cases we are interested in only one (or a few) of the equations of the model and attempts to measure its parameters statistically without a complete knowledge of the entire