- 1 (74.91 KiB) Viewed 31 times
are limited in size. For this game we will limit our stacks to
three elements each. For the explanation we will initially limit
ourselves to three stacks with a depth of three. You can see above
in the picture a physical example with 4 stacks of depth 3.
Back to our explanation, above these three stacks, you have a
list of five positions from 0 to 4. The first stack is aligned with
position 1; stack 2 with position 2, and stack 3 with position 3.
Positions 0 and 4 don't have a stack aligned with them.
See this figure below to have a better idea about how this
structure looks.
The structure is filled with nine beads: 3 As, 3 Bs and 3 Cs,
representing 3 colours. Initially the structure looks like this
with the 3 stacks each filled with either all As, Bs, or
Cs.
The structure always has 9 beads. The beads can move one
position at a time to an empty position. An empty position is
represented by a "." here.
For example from the initial configuration, one can pop a
bead from the first stack and switch it with the top bead in the
second stack in the follow series of moves:
The game consists of getting a random configuration card and
doing the minimum numbers of moves to change the beads of the
AbacoStack to that given configuration.
For example, you get the following card:
You need to move the beads one by one to get
The game is played by a user, not the computer. The computer
would generate a random configuration card and the user would have
to solve the game by indicating the moves to do in order to change
the configuration from the initial one to the one indicated on the
card.
The moves are indicated by the following input
pair ij where i is
a digit and j a character like the
following:
you nee help me the following task
this is a pyhon homework
Task 3: The AbacoStack Class
Implement a class named AbacoStackto
represent the AbacoStack structure. An instance of this class
should store bounded stacks and a list representing the top
row. The size of the list will be the number of bounded stacks
+ 2. The number of bounded stacks and their common depth
should be given as input to the constructor of this class. The
structure should be initialized so that each stack has only one and
unique colour (colours are represented by letters A, B, C, etc.).
Another property of an instance of this class is to store the
numbers of moves already done since the initialization.
Initially, it should be 0.
Implement a method moveBead(move) which
changes the state of the AbacoStack instance based on the valid
moves indicated above. move is a string of
two characters. Raise an Exception "Error: invalid move" if the
move cannot be done. For
example 2d cannot be done if Stack2 is
full, or 1r cannot be done if there is a
bead in position 2 of the top list.
Implement a method isSolved(card) which
returns TRUE if the state of the instance corresponds to the
configuration card, FALSE otherwise. cardis an
instance of the Card class.
Implement the reset() method which resets the
property moves to zero and rearrange the stack
to the initial position with each stack having its own
beads.
Implement a method named show(card), that takes an
optional parameter card and displays the state
of the AbacoStack instance. card is an instance
of the class Card. When the parameter card is
present, the configuration card will also be displayed on the side
of the AbacoStack instance in addition to the number of moves
already taken since the start (like below) otherwise only the state
of the abacoStack is shown as below.
BROOKLYN'S FINEST THE STILETTO BOOK CENY HOUSEHOLD DECORATES yraga ng 000 20 K HOME NI .. - אצלנו ENREDON BARE R Ta nam