- In this problem, you and a partner are to come up with a scheme for communicating the value of a hidden card. The game is played as follows: Your partner is sent out of the room.A dealer hands you 5 cards from a standard 52 card deck.You look at the cards, and hand them back to the dealer, one by one, in whatever order you choose.The dealer takes the first card that you hand her and places it, face up, in a spot labeled “0”‘. The next three cards that you hand her, she places, similarly, in spots labeled “1”, “2”, and “3”. The last card that you hand her goes, face down, in a spot labeled “hidden”. (While you control the order of the cards, you have no control over their orientations, sitting in their spots; so you can’t use orientation to transmit information to your partner.) Your partner enters the room, looks at the four face-up cards and the spots in which they lie and, from that information (and your previously-agreed-upon game plan), determines the suit and value of the hidden card.Question: What is the foolproof scheme that you and your partner settled on ahead of time?..
- A square table has a coin at each corner. Design an execution sequence, each of whose steps consists of one of the following operations:ONE: The operation chooses a coin (possibly a different one with each execution of the operation) and flips it.SIDE: The operation chooses a side of the table and flips the two coins along that side.DIAG: The operation chooses a diagonal of the table and flips the two coins along that diagonal.such that at some point during the execution (not necessarily at the end), a state where all coins are turned the same way (all heads or all tails) obtains.
- A follow up question- Suppose the three suitors know each other (an assumption that’s not needed in the original problem). Then find a new strategy for the king where the king only needs to ask a question of any two of the three suitors in order to pick the bridegroom……….
Crafting India’s Foremost-&-Distinctive Human Equity Investment Marketplace
Copyright © 2025 | Badgefree LLP | All Rights Reserved