|
2022-06-02, 00:28
|
#1 |
Aug 2002
2×19×223 Posts |
June 2022
|
|
|
|
2022-06-15, 13:36
|
#2 |
|
Jun 2016
1910 Posts |
To help people check their answers without spoiling the puzzle, these were the last two digits of each of my values for n up to 20.
00, 01, 03, 11, 35, 08, 80, 48, 14, 23, 34, 49, 46, 37, 33, 34, 76, 71, 38, 52 |
|
|
|
|
2022-06-17, 23:51
|
#3 |
|
Jan 2017
2·73 Posts |
Has anyone here tried to calculate values especially far? I've computed up to 23 (with a fast enough program that calculating the next few values would be realistic if I left it running for a while).
|
|
|
|
|
2022-06-19, 05:30
|
#4 | |
|
Oct 2017
2×32×7 Posts |
Quote:
|
|
|
|
|
|
2022-06-19, 09:58
|
#5 | |
"Kebbaj Reda"
May 2018
Casablanca, Morocco
32×11 Posts |
Quote:
For confirmation : n 22 finish by 39 n 23 finish by 62 |
|
|
|
|
|
2022-06-19, 14:03
|
#6 |
|
Jan 2017
100100102 Posts |
Those values match what I got. There are some things I'd say about the calculation, but they'd be kind of spoilery, so perhaps better left for private messages or after the month is over.
|
|
|
|
|
2022-06-20, 09:47
|
#7 |
|
Jun 2016
19 Posts |
My (fairly naive, single-threaded) code took about two and a half hours to do n=20, and it goes up by a factor of about 4 for each increase in n. By multithreading it I think I could do n=23 or even n=25 in a not totally absurd time, but wondering if other people have faster approaches?
|
|
|
|
|
2022-06-20, 13:42
|
#8 |
|
Jan 2017
2×73 Posts |
Well my code is faster, but not a totally different approach - still proportional to the overall number of polyominoes. I'll send details in PM.
|
|
|
|
|
2022-06-21, 17:29
|
#9 |
|
Jul 2015
11 Posts |
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. 
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| June 2020 | tgan | Puzzles | 16 | 2020-07-05 22:21 |
| June 2018 | Batalov | Puzzles | 8 | 2018-07-04 06:45 |
| June 2017 | R. Gerbicz | Puzzles | 14 | 2017-07-03 20:01 |
| June 2016 | Xyzzy | Puzzles | 16 | 2016-07-07 02:51 |
| June 2015 | Batalov | Puzzles | 10 | 2015-07-07 14:59 |
