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 type of sequential second worth auction during which an auctioneer directs participants to beat the present, standing bid. New bids should increase the present bid by a predefine

GAME PLAYING IN CLASS GAME 1 Adding Numbers—Win at 100 This game is described in Exercise 3.7a. In this version, two players take turns choosing a number between 1 and 10 (inclus

A sealed-bid second worth auction during which participants every simultaneously submit bids. The auctioneer discloses the identity of the very best bidder who is said the winner.

This condition is based on a counting rule of the variables included and excluded from the particular equation. It is a necessary but no sufficient condition for the identi

Ship, Captain and Crew (sometimes called Ship, Captain and Mate) was a popular bar game played for drinks with five dice and throwing cup. Each player gets three throws. He has to

Consider the Cournot duopoly model in which two firms, 1 and 2, simultaneously choose the quantities they will sell in the market, q1 and q2. The price each receives for each unity

A market mechanism during which an object, service, or set of objects is being purchased, instead of sold, to the auctioneer. The auction provides a selected set of rules which wil

A bidding increment is defined by the auctioneer as the least amount above the previous bid that a new bid must be in order to be adequate to the auctioneer. For example, if the in

Not technically an auction, however a posted-price procedure during which the auctioneer sets a worth and sells to the primary bidder willing to pay it. The auction ends as soon as

A zero add game may be a special case of a continuing add game during which all outcomes involve a add of all player's payoffs of zero. Hence, a gain for one participant is usually