Thread: June 2022
View Single Post
Old 2022-06-21, 17:29   #9
KangJ
 
Jul 2015

1410 Posts
Default Question about algorithm

I am seriously struggling with this problem.

If there is an algorithm that efficiently creates polyomino without duplicates, what would it be?

The method of creating and saving all polyominos to check for duplicates is easily limited around N=15.

Is it correct to save all polyominos of size N-1 to create a new polyomino of size N?

I tried to classify polyominos by width size, but the method of saving all polyominos to check for duplicates also runs into a limit as N increases.

KangJ is offline   Reply With Quote