home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!sun-barr!cs.utexas.edu!torn!utcsri!neat.cs.toronto.edu!pedmonds
- Newsgroups: sci.math
- From: pedmonds@cs.toronto.edu ("Philip G. Edmonds")
- Subject: Re: Solitaire games
- Message-ID: <92Sep2.171725edt.48031@neat.cs.toronto.edu>
- Organization: Department of Computer Science, University of Toronto
- References: <4906@balrog.ctron.com> <Btyo5z.D8q@cs.psu.edu> <1992Sep2.204931.29320@wdl.loral.com>
- Date: 2 Sep 92 21:17:38 GMT
- Lines: 16
-
- In article <1992Sep2.204931.29320@wdl.loral.com> mab@wdl39.wdl.loral.com (Mark A Biggar) writes:
- >In article <Btyo5z.D8q@cs.psu.edu> morgan@math.psu.edu (Ilene Morgan) writes:
- >>My game with license plates is to try to find a word that contains the
- >>letters of the license plate in order, not necessarily consecutively.
- >>For example, XPV -> expressive. My license plate used to have XPF; I never
- >>did think of one for that.
- >
- >expeditefull
- >excerptfull
- >exemplify
- >exemplification
-
- ex post facto
-
- (from Webster's)
- Phil.
-