Skip to main content
Code Review

Return to Answer

Formatted number
Source Link
J_H
J_H
  • 35.2k
  • 3
  • 32
  • 129

,There There are 6,200,686,124,225,191 free polyominoes that touch all four edges of an 8x8 grid (A268311), plus however many are 8x7, 7x7, 8x6, etc.

That's too many for my disk. How about sampling some at random? Generate a random 64-bit integer and check that it represents a connected polyomino and that it is the minimal representation after translation, reflection and rotation. About 1 in 3000 integers should pass the tests, so you should have a large sample reasonably quickly.

,There are 6,200,686,124,225,191 free polyominoes that touch all four edges of an 8x8 grid (A268311), plus however many are 8x7, 7x7, 8x6, etc.

That's too many for my disk. How about sampling some at random? Generate a random 64-bit integer and check that it represents a connected polyomino and that it is the minimal representation after translation, reflection and rotation. About 1 in 3000 integers should pass the tests, so you should have a large sample reasonably quickly.

There are 6,200,686,124,225,191 free polyominoes that touch all four edges of an 8x8 grid (A268311), plus however many are 8x7, 7x7, 8x6, etc.

That's too many for my disk. How about sampling some at random? Generate a random 64-bit integer and check that it represents a connected polyomino and that it is the minimal representation after translation, reflection and rotation. About 1 in 3000 integers should pass the tests, so you should have a large sample reasonably quickly.

Formatted number
Source Link
edit approved Sep 8 at 23:35
miracle173
edit approved Sep 8 at 23:35
miracle173
  • 1.3k
  • 6
  • 19

There,There are 62006861242251916,200,686,124,225,191 free polyominoes that touch all four edges of an 8x8 grid (A268311), plus however many are 8x7, 7x7, 8x6, etc.

That's too many for my disk. How about sampling some at random? Generate a random 64-bit integer and check that it represents a connected polyomino and that it is the minimal representation after translation, reflection and rotation. About 1 in 3000 integers should pass the tests, so you should have a large sample reasonably quickly.

There are 6200686124225191 free polyominoes that touch all four edges of an 8x8 grid (A268311), plus however many are 8x7, 7x7, 8x6, etc.

That's too many for my disk. How about sampling some at random? Generate a random 64-bit integer and check that it represents a connected polyomino and that it is the minimal representation after translation, reflection and rotation. About 1 in 3000 integers should pass the tests, so you should have a large sample reasonably quickly.

,There are 6,200,686,124,225,191 free polyominoes that touch all four edges of an 8x8 grid (A268311), plus however many are 8x7, 7x7, 8x6, etc.

That's too many for my disk. How about sampling some at random? Generate a random 64-bit integer and check that it represents a connected polyomino and that it is the minimal representation after translation, reflection and rotation. About 1 in 3000 integers should pass the tests, so you should have a large sample reasonably quickly.

Source Link
Martin Fuller
Martin Fuller
  • 51
  • 1

There are 6200686124225191 free polyominoes that touch all four edges of an 8x8 grid (A268311), plus however many are 8x7, 7x7, 8x6, etc.

That's too many for my disk. How about sampling some at random? Generate a random 64-bit integer and check that it represents a connected polyomino and that it is the minimal representation after translation, reflection and rotation. About 1 in 3000 integers should pass the tests, so you should have a large sample reasonably quickly.