Free polyominoes enumeration: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) (alphabetize, minor clean-up) |
Thundergnat (talk | contribs) m (use wiki markup for links) |
||
Line 32: | Line 32: | ||
└─┘</pre> |
└─┘</pre> |
||
For a slow but clear solution see this Haskell Wiki page: |
For a slow but clear solution see this Haskell Wiki page: [http://www.haskell.org/haskellwiki/The_Monad.Reader/Issue5/Generating_Polyominoes Generating Polyominoes] |
||
http://www.haskell.org/haskellwiki/The_Monad.Reader/Issue5/Generating_Polyominoes |
|||
<b>Bonus Task</b>: you can create an alternative program (or specialize your first program) to generate very quickly just the number of distinct free polyominoes, and to show a sequence like: |
<b>Bonus Task</b>: you can create an alternative program (or specialize your first program) to generate very quickly just the number of distinct free polyominoes, and to show a sequence like: |
||
Line 39: | Line 39: | ||
1, 1, 1, 2, 5, 12, 35, 108, 369, 1285, 4655, 17073, 63600, 238591, 901971, 3426576, ... |
1, 1, 1, 2, 5, 12, 35, 108, 369, 1285, 4655, 17073, 63600, 238591, 901971, 3426576, ... |
||
Number of free polyominoes (or square animals) with n cells: |
Number of free polyominoes (or square animals) with n cells: [[oeis:A000105|OEIS: A000105]] |
||
http://oeis.org/A000105 |
|||