944,172 Members | Top Members by Rank

Ad:
You are currently viewing page 1 of this multi-page discussion thread
Nov 14th, 2007
0

Scheme Help

Expand Post »
Ok I have to write a program that creats an ADT to store a set of cards that are imput so that i can use the command (a-card rank suit) and (rank card) (suit card) to firstly construct the card and then return its rank and suit. Unfortunately I am struggling alot with this and wondering if someone could prod me in the correct direction.

(define suit (list 'clubs 'diamonds 'hearts 'spades))
(define rank (list 1 2 3 4 5 6 7 8 9 10 11 12 13))
(define (a-card rank suit)
          (list cons rank suit))

any and all prods greatly appreciated, as this is just giving me an error
Similar Threads
Reputation Points: 10
Solved Threads: 0
Newbie Poster
nanaman is offline Offline
8 posts
since Nov 2007
Nov 14th, 2007
0

Re: Scheme Help

(define (make-card rank suit) (list rank suit))
(define (a-card rank suit) (make-card rank suit))

Using this I can get (a-card) to return the correct value, how do I then get this value to be passed out of the procedure (i.e. so I can recall it and also use it for (card) ?

Thanks
Reputation Points: 10
Solved Threads: 0
Newbie Poster
nanaman is offline Offline
8 posts
since Nov 2007
Nov 14th, 2007
0

Re: Scheme Help

Try defining accessor functions that return particular elements of the list using car and cdr.
Reputation Points: 11
Solved Threads: 5
Light Poster
azimuth0 is offline Offline
36 posts
since May 2006
Nov 14th, 2007
0

Re: Scheme Help

There are no procedures in scheme, only functions. Whenever you say define, you are naming an expression that evaluates to something.

Hence, follow along:
(a-card 13 'spades) becomes
(make-card 13 'spades) becomes
(list 13 'spades) becomes
'(13 'spades)
The make-card and a-card functions do the same thing: take a rank and suit and return a card. Why not get rid of one of them?

I think you need to re-read your class notes about the difference between a list and a pair.

Personally, I would store the card as a pair:
(define make-card (lambda (rank suit) (cons rank suit)))
Or, using the shortcut syntax:
(define (make-card rank suit) (cons rank suit))

Now, you know that a card is a pair of '(rank . suit), so to get out the rank or suit you only need a new function get knows what a card looks like:
(define (rank card) (car card))
(define (suit card) (cdr card))

The purpose is to make it so that no one knows that a card is just a pair (or a list or something else). You know, because that is how you are storing it. But anyone else using your program only needs to know three functions:
make-card rank suit: return a card object
rank card: return the rank of a card object
suit card: return the suit of a card object

Hope this helps.
Last edited by Duoas; Nov 14th, 2007 at 2:07 pm.
Featured Poster
Reputation Points: 1140
Solved Threads: 229
Postaholic
Duoas is offline Offline
2,039 posts
since Oct 2007
Nov 14th, 2007
0

Re: Scheme Help

That is fantastic, however, the reason I was playing with a list was that I need to store 5 cards (a poker hand), would the best way be to make the pair and then store the pair in a list along with the other 5 then?

thanks again
Reputation Points: 10
Solved Threads: 0
Newbie Poster
nanaman is offline Offline
8 posts
since Nov 2007
Nov 14th, 2007
0

Re: Scheme Help

Yes. A card is a single object. If you want a list of cards, then store a list of cards, not a list of suits and ranks.

(define dead-mans-hand (list
  (make-card 13 'spades)
  (make-card 13 'clubs)
  (make-card 8 'spades)
  (make-card 8 'clubs)
  (make-card 2 'hearts)
  ))
Thereafter, you can get, say, the second card's suit with:
(suit (second dead-mans-hand))

Hope this helps.
Last edited by Duoas; Nov 14th, 2007 at 7:13 pm.
Featured Poster
Reputation Points: 1140
Solved Threads: 229
Postaholic
Duoas is offline Offline
2,039 posts
since Oct 2007
Nov 15th, 2007
0

Re: Scheme Help

(define c1 (a-card 7 'clubs))
(define c2 (a-card 8 'spades))
(define c3 (a-card 9 'hearts))
(define c4 (a-card 10 'clubs))
(define c5 (a-card 11 'diamonds))
(define (a-hand c1 c2 c3 c4 c5) (list c1 c2 c3 c4 c5))

The help so far has been fantastic, I now have the single cards working, and am working on constructing the hand, the a-hand function works fine, however the next thing is to impliment "(contents hand) - returns a list of card objects (as constructed by a-card in the hand."

Now i have no problem doing this as i could just simply put

 
(define (hand c1 c2 c3 c4 c5) (a-hand c1 c2 c3 c4 c5))
(define (contents hand) (list (car hand) (car (cdr hand)) (car (cdr (cdr hand))) (car (cdr (cdr (cdr hand)))) (cdr (cdr (cdr (cdr hand)))))

That the correct way to do it you think?

Thanks again for all the help

*Edit* just tried this way and it is giving me an error of "wrong type in arg1" >.<
*Edit* Just removed the (Define (hand c1 c2 .....) statement and simply type (contents (a-hand c1 c2 c3 c4 c5)) and it works fine

Just wondering though, how can i seperate the two things in a card in a hand? would it be

 (suit (car hand)) etc?
Last edited by nanaman; Nov 15th, 2007 at 7:55 am.
Reputation Points: 10
Solved Threads: 0
Newbie Poster
nanaman is offline Offline
8 posts
since Nov 2007
Nov 15th, 2007
0

Re: Scheme Help

Since a "hand" object is a list of cards, and you want to get a list of cards from a hand, all you need to do is return the hand:
(define (contents hand) hand)
Now, if a "hand" object were something else, you'd need to do some work to turn it into a list...


Quote ...
Just wondering though, how can i seperate the two things in a card in a hand? would it be
(suit (car hand))
etc?
Exactly.
Featured Poster
Reputation Points: 1140
Solved Threads: 229
Postaholic
Duoas is offline Offline
2,039 posts
since Oct 2007
Nov 15th, 2007
0

Re: Scheme Help

Is there anyway to sort a list of numbers (and words alphabetically) into order?

thanks
Reputation Points: 10
Solved Threads: 0
Newbie Poster
nanaman is offline Offline
8 posts
since Nov 2007
Nov 16th, 2007
0

Re: Scheme Help

Of course. You'll need to read up on recursion.

There is a basic principle: if you have a list
(a b c d)
(which, if you remember, is really:
(a . (b . (c . (d . ()))))
and if you can do something to the car of the list (or a) and the cdr of the list (that is, the rest of the list: (b c d)),
then you can do something to the whole list.

Remember, your list is a list of 'card's. So you'll have to use the card ADT to get the rank of each card and compare its value.

Hope this gets you started. Using scheme (and other functional languages) require you to think pretty hard.
Featured Poster
Reputation Points: 1140
Solved Threads: 229
Postaholic
Duoas is offline Offline
2,039 posts
since Oct 2007

This thread is solved

Either the thread starter or a moderator has marked this thread as solved. You can most likely trust the responses and answers given. There is most likely no reason for any further responses to be posted here. If you have a related question, please start a new thread in this forum instead.

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.
Message:
Previous Thread in Legacy and Other Languages Forum Timeline: A multilingual coded Hello World! thread
Next Thread in Legacy and Other Languages Forum Timeline: Matlab code using Genetic Algorithm for a digital images correlation





About Us | Contact Us | Advertise | Acceptable Use Policy
Forum Index | Build Custom RSS Feed


Follow us on Twitter


© 2011 DaniWeb® LLC