R. Clayton (rclayton@monmouth.edu)
(no date)
I was looking at the output from gen-game; it looks like both gen-game and
gen-game -d producing same input data.
They do, and they produce the same data over and over. I haven't updated
gen-game yet.
Do spaces indication of start of new pile in the first line input?
See the answer to this question given in the message "Assignment 2 input
questions", (yes, that should have been "Assignment 3") which can be found in
your mailbox, on the hypermail archive, or in the news group.
Does rule 5 mean the game could always start with the right-most pile? Also
do any of the the move 1-4 start from the right-most pile?
I don't understand what you mean by "start from the right-most pile".
Play ends when all cards have been dealt. If we use pile moves, then does it
means all the cards in the pile has been dealt?
Yes, although it has nothing to do with pile moves.
When there is one pile, it could be possible that no card from the left most
pile moved. In that situation, could all the cards in that pile be thought
of as having been dealt with?
I don't understand this question, but I'm getting the impression you're having
trouble with the concept of dealing. When the game starts, you have a deck of
cards face down (when a card is face down, you can't tell what suit or rank it
is) in your hand and the tableau (which is just the configuration of cards on
the table in front of you) is empty (that is, there are no cards on the table).
Each time you deal, you take the top card from the deck in your hand and place
it, face up, to the immediate right of the rightmost pile in the tableau. The
first time you deal a card, there are no other piles in the tableau, which
means you can put the first card down anywhere. When there are no more cards
in your hand, the deal is over, because you have no more cards to deal.
Any suggestions on choosing the rule on each move?
That's what you have to figure out.
If 5b above is correct, then depending on the type of the move chosen, it is
possible that different pile structures could result while dealing with the
cards. How can you determine which move sequence creates wining tables
(smallest pile)? Also, the tableau (line 2-n) could be valid but not the one
computed. If 5a correct, then there would be 4 possible computed piles based
on the rule used. The smallest pile would be the winning one. If one of the
computed pile matches with the line (2-n), then it is a derivable one, and
could be wining or non-winning. If none of the piles match, then it is
impossible. Could please indicate which one is correct assumption?
This question is too complicated for me to understand.
This archive was generated by hypermail 2.0b3 on Fri May 09 2003 - 15:30:05 EDT