[comp.lang.icon] Card game algorythms

TENAGLIA@mis.mcw.edu (Chris Tenaglia - 257-8765) (11/19/90)

I've been thinking about card game algorythms. It seems to me that cards
belong in a set rather than a list. Each hand would also be a set. Since
order in a set is arbitrary, I become a little confused as to shuffling
the deck. And even if one were to use lists, shuffling is an operational
remnant of our physical world. In a computer, virtual shuffling could
just consist of dealing cards from random deck positions.

Is there one basic shuffling concept, or are there several approaches?

Chris Tenaglia (System Manager) | Medical College of Wisconsin
8701 W. Watertown Plank Rd.     | Milwaukee, WI 53226
(414)257-8765                   | tenaglia@mis.mcw.edu, mcwmis!tenaglia

flee@dictionopolis.cs.psu.edu (Felix Lee) (11/20/90)

Each hand is a set, but the deck itself is a list.  If you consider
solitaire games, then the various piles, the talon, and the stock are
all lists.  I've wanted a generalized solitaire language for a while..
--
Felix Lee	flee@cs.psu.edu