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.