home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.math:17032 rec.games.abstract:633
- Newsgroups: sci.math,rec.games.abstract
- Path: sparky!uunet!cs.utexas.edu!sun-barr!ames!agate!linus!progress!neil
- From: neil@progress.COM (Neil Galarneau)
- Subject: Re: Game of pentominos
- Message-ID: <1992Dec16.182611.10896@progress.com>
- Sender: usenet@progress.com (Mr. Usenet)
- Nntp-Posting-Host: pinta
- Organization: Progress Software Corp.
- References: <martel.724342292@marvin> <1992Dec15.154734.23894@odin.diku.dk>
- Date: Wed, 16 Dec 1992 18:26:11 GMT
- Lines: 38
-
- torbenm@diku.dk (Torben AEgidius Mogensen) writes:
-
- >martel@marvin.mr.sintef.no (Paulo Martel) writes:
-
- >>After several tries I gave up a combinatorial analysis of the game of
- >>pentominos. Would someone point me to a reference, or briefly explain
- >>how one could compute the total number of solutions for a grid of a
- >>given size (6x10, 5x12, 4x15, 3x20).
-
- >I saw a paper once that reported the number of solutions to each of
- >these rectangle sizes. It used a heavily optimized machine code
- >program to exhaustively search for all solutions. I remember that for
- >the 3x20 case there are only two solutions barring reflections and
- >rotations. These are quite easy to find by hand. The number of
- >solutions for the 6x10 case was quite large, but I don't recall the
- >number. I also don't recall the title or author of the paper.
-
- > Torben Mogensen (torbenm@diku.dk)
-
- Ah... Good old pentominoes.
-
- Several years ago, motivated by a passage in one of Clarke's novels, several
- of us programmed pentominoes.
-
- It is not very hard to solve it, it is a lot harder to solve it efficiently.
-
- The programming was a lot of fun.
-
- There are about 2100 solutions to the 6x10 case.
-
- A slow program will take 30 seconds per solution, a fast one can take less
- than 5 seconds per solution.
-
- We didn't try other board sizes.
-
-
- Neil
- neil@progress.com
-