This assignment is about designing Finite State Machines (FSM) for a two-player game. The game is administered
Question:
This assignment is about designing Finite State Machines (FSM) for a two-player game. The game is
administered by a referee who, using a random number, decides which one of the players makes the
first move: if the random number is odd, player 1 starts; if the random number is even, player 2 starts.
The referee also decides who is the winner at the end based on the following rules:
- The game is based on challenges. Each player sends a "challenge" that holds a number to the
other player.
- The receiving player has to answer the "challenge" by sending a "challenge answer" that holds
a number as follows:
o if the received number is odd, the "challenge answer" must be an odd number or a
smaller number (can be odd or even) than the received number.
o if the received number is even, the "challenge answer" must be an even number or a
bigger number (can be odd or even) than the received number.
- The player who runs out of cards early loses (i.e., a player loses when they cannot send a
challenge answer as per the rules above).
- If a received card is as expected, the receiver must send an answer within 30 seconds.
Otherwise, the other player notifies the referee. The referee than declares the winner.
- If a received answer is not as expected, the receiving player should notify the referee. The
referee then declares the winner.
IMPORTANT: each one of the players knows all the numbers the other player has. With that,
the game is like a chess game, not a card game where cards are hidden from other players.
The allowed numbers to use in a challenge by each player is based on a set of digits derived from
their own student's ID. For example, if the ID of the student is 12345678, then S = {1, 2, 3, 4, 5, 6,
7, 8}. Using this set S, the allowed numbers for each player (from their ID) are as follows:
- Odd numbers are constructed using the first half of S as the alphabet. Each element of the
alphabet can only appear once. For the set S above, the following are examples of odd
numbers that can be constructed: 1, 13, 21, 23...
Note: if |S| is odd, the middle element of S is not part of the alphabet.
- Even numbers are constructed using the second half of S as the alphabet. Each element of the
alphabet can only appear once. For the set S above, the following are examples of even
numbers that can be constructed: 6, 8, 68, 78...
Note: if |S| is odd, the middle element of S is part of the alphabet.
2. Deliverables:
You need to submit your answer as a set of FSMs (i.e., drawings), all of them in a PDF file. Each
FSM should have a quick description. However, the description of each FSM does not have to be a
complete rewriting of the machine's behavior
Expert Answer:
Here are the finite state machines for the twoplayer game described above Referee FSM States Start R... View the full answer
