Code of square

DW71H14GBTJeK6fE1RcSBVdKdAhrHJYM

Canonical form: DaUayP5fWmYHjcNNj3JnBN6rQXiMjg6
24901 d-transversals.
Found first 1075 ODLK found in path (1,1) to (1,5): https://boinc.tbrada.eu/download/DaUay.1.1-5.txt

Hello, Tomáš Brada!
I tried the kanonb.exe program for this DLS of order 17

JQiBJzfpi4cDA7gjVeqHYS9v66FyyHaywfvhUvgBXnkJa2PbDv7UgMAgKYZupiCsckFX7b8kMdaEFFREt4gbPtRSf2

The program ran for 11 hours and did not end.

Console

C:\Users\Дом\Downloads\libr>kanonb.exe  0<a.txt 1>out2.txt
# KanonizerV(17): transformations: 36 + 8, initializing...
4182016

I am assuming there was not enough RAM.
How much RAM is required for the program?

The program would have ended after reaching 5160960. I run your DLK and got the solution below.

in: JQiBJzfpi4cDA7gjVeqHYS9v66FyyHaywfvhUvgBXnkJa2PbDv7UgMAgKYZupiCsckFX7b8kMdaEFFREt4gbPtRSf2
cf: JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
num_dtrans: 204995269

0 2 C E 7 B 8 6 F 4 D 3 A 9 G 5 1                             
5 1 3 B D G A 8 E C 4 9 0 F 6 2 7                                                                                                   
B 6 2 4 A C F 9 D 5 0 1 E 7 3 G 8                                 
6 A 7 3 5 9 B E C 1 2 D G 4 F 8 0                             
2 7 9 G 4 6 0 A B 3 C F 5 E 8 1 D       
4 3 G 0 F 5 7 1 A B E 6 D 8 2 C 9       
A 5 4 F 1 E 6 G 9 D 7 C 8 3 B 0 2                    
C 9 6 5 E 2 D 7 0 G B 8 4 A 1 3 F                                                                                                   
D C B A 9 0 1 2 8 E F G 7 6 5 4 3       
1 D F 6 C 8 5 0 G 9 3 E 2 B A 7 4                           
E G 5 D 8 4 9 3 7 0 A 2 F 1 C B 6       
7 4 E 8 3 A 2 5 6 F 9 B 1 G 0 D C                                 
3 F 8 2 B 1 4 D 5 6 G A C 0 7 9 E                             
G 8 1 C 0 3 E F 4 2 5 7 B D 9 6 A 
8 0 D 9 2 F G B 3 7 1 4 6 C E A 5 
9 E A 1 G 7 C 4 2 8 6 0 3 5 D F B 
F B 0 7 6 D 3 C 1 A 8 5 9 2 4 E G 

Additionally I upload my cache files for the program: https://boinc.tbrada.eu/download/ndlk-dat-2101a.zip

The program would have ended after reaching 5160960. I run your DLK and got the solution below.

Thank you.
A beautiful square :)



You did not answer the question

How much RAM is required for the program?

If I understand correctly, cache files will help quickly canonicalize DLS (?)

You did not answer the question

How much RAM is required for the program?

If I understand correctly, cache files will help quickly canonicalize DLS (?)

Cache file helps to quickly canonicalize DLS. If not present, the program generates the missing file. But for orders 16+ is is very slow. So you can extract kanonb_cache_17.dat from a zip file, and try it out, it will solve in few seconds. It uses less than 400 MB of RAM.

Cache file helps to quickly canonicalize DLS. If not present, the program generates the missing file. But for orders 16+ is is very slow. So you can extract kanonb_cache_17.dat from a zip file, and try it out, it will solve in few seconds. It uses less than 400 MB of RAM.

Yes it works

C:\Users\Дом\Downloads\ndlk-dat-2101a>kanonb.exe  0<a.txt 1>out2.txt
# KanonizerV: read kanonb_cache_17.dat: 17 36 5160960 175472640

Original DLS of order 17

JbFtpH5nbWMPCcFUbUPgD1pDEjeLiHPnzASPdWaroX3fkX6pDvQE3Ue7oAWi8kpwNwmGVYhcEt21kdSe51Qrzq5

CF

JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2

Tomáš Brada
I canonized 14 DLS from MOLS system of order 17

JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2
JVUesFePXAN1rG8UWDrmYhv7h3UUqSqVraVEBWcofey2tPsEJpepgvNg8vu32qL8dazxSPiVu1Ttj29tL
J39x3jjhxnHszoQpfcDrAzx27ZgCpvYW9JZU9nm4EozssVGc6mUYnCWuV7HzfwhWK2hEtntURM2pDGa9ins
JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2
J39x3jjhxnHszoQpfcDrAzx27ZgCpvYW9JZU9nm4EozssVGc6mUYnCWuV7HzfwhWK2hEtntURM2pDGa9ins
JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
J39x3jjhxnHszoQpfcDrAzx27ZgCpvYW9JZU9nm4EozssVGc6mUYnCWuV7HzfwhWK2hEtntURM2pDGa9ins
JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2
J39x3jjhxnHszoQpfcDrAzx27ZgCpvYW9JZU9nm4EozssVGc6mUYnCWuV7HzfwhWK2hEtntURM2pDGa9ins
JVUesFePXAN1rG8UWDrmYhv7h3UUqSqVraVEBWcofey2tPsEJpepgvNg8vu32qL8dazxSPiVu1Ttj29tL
JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2
JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4

Can you make the program remove duplicate CFs?

Can you make the program remove duplicate CFs?

The program is called sort.

sort -u <input.txt

JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
JVUesFePXAN1rG8UWDrmYhv7h3UUqSqVraVEBWcofey2tPsEJpepgvNg8vu32qL8dazxSPiVu1Ttj29tL
JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2
J39x3jjhxnHszoQpfcDrAzx27ZgCpvYW9JZU9nm4EozssVGc6mUYnCWuV7HzfwhWK2hEtntURM2pDGa9ins

The program is called sort.

sort -u <input.txt

JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
JVUesFePXAN1rG8UWDrmYhv7h3UUqSqVraVEBWcofey2tPsEJpepgvNg8vu32qL8dazxSPiVu1Ttj29tL
JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2
J39x3jjhxnHszoQpfcDrAzx27ZgCpvYW9JZU9nm4EozssVGc6mUYnCWuV7HzfwhWK2hEtntURM2pDGa9ins

Thanks.

JHep946hdpmD3PbVe64oR1i2JacXn5EZhBapLW1bdkDY4JdXfnDizzcaKLehQmyCFnBMwusRtF4PEhke4
0 2 12 14 7 11 8 6 15 4 13 3 10 9 16 5 1
5 1 3 11 13 16 10 8 14 12 4 9 0 15 6 2 7
11 6 2 4 10 12 15 9 13 5 0 1 14 7 3 16 8
6 10 7 3 5 9 11 14 12 1 2 13 16 4 15 8 0
2 7 9 16 4 6 0 10 11 3 12 15 5 14 8 1 13
4 3 16 0 15 5 7 1 10 11 14 6 13 8 2 12 9
10 5 4 15 1 14 6 16 9 13 7 12 8 3 11 0 2
12 9 6 5 14 2 13 7 0 16 11 8 4 10 1 3 15
13 12 11 10 9 0 1 2 8 14 15 16 7 6 5 4 3
1 13 15 6 12 8 5 0 16 9 3 14 2 11 10 7 4
14 16 5 13 8 4 9 3 7 0 10 2 15 1 12 11 6
7 4 14 8 3 10 2 5 6 15 9 11 1 16 0 13 12
3 15 8 2 11 1 4 13 5 6 16 10 12 0 7 9 14
16 8 1 12 0 3 14 15 4 2 5 7 11 13 9 6 10
8 0 13 9 2 15 16 11 3 7 1 4 6 12 14 10 5
9 14 10 1 16 7 12 4 2 8 6 0 3 5 13 15 11
15 11 0 7 6 13 3 12 1 10 8 5 9 2 4 14 16

JZavs7uAV4CURwBtFMoJPcLBijAc1hE3FotZHERYCMPtfJ1PMTFPDqmULKieXppg11yArjb6WbfYS3zYz2
0 3 4 10 5 11 8 6 2 13 15 14 9 7 16 12 1
12 1 16 5 0 6 10 8 3 14 13 4 7 15 11 2 9
14 11 2 15 13 1 7 9 16 0 5 12 8 10 3 4 6
9 13 10 3 1 0 2 12 15 6 11 8 4 16 5 7 14
16 8 1 14 4 7 13 15 6 2 12 3 5 0 9 11 10
1 15 8 2 3 5 12 0 7 11 16 6 14 4 10 9 13
5 2 14 8 10 16 6 11 12 15 7 13 1 9 4 0 3
4 6 3 13 14 9 15 7 11 12 0 2 10 5 1 16 8
11 10 9 4 16 15 14 13 8 3 2 1 0 12 7 6 5
8 0 15 11 6 14 16 4 5 9 1 7 2 3 13 10 12
13 16 12 7 15 3 9 1 4 5 10 0 6 8 2 14 11
3 7 6 12 2 10 0 5 9 16 4 11 13 14 8 1 15
6 5 7 16 11 13 4 14 10 1 3 9 12 2 15 8 0
2 9 11 0 12 8 5 10 1 4 14 16 15 13 6 3 7
10 12 13 6 8 4 11 16 0 7 9 15 3 1 14 5 2
7 14 5 1 9 12 3 2 13 8 6 10 16 11 0 15 4
15 4 0 9 7 2 1 3 14 10 8 5 11 6 12 13 16

JVUesFePXAN1rG8UWDrmYhv7h3UUqSqVraVEBWcofey2tPsEJpepgvNg8vu32qL8dazxSPiVu1Ttj29tL
0 2 4 14 6 3 11 12 10 13 16 5 15 7 9 8 1
8 1 10 5 12 7 2 4 9 15 11 0 14 6 13 16 3
10 14 2 12 16 0 15 11 1 7 13 4 6 8 3 9 5
6 9 8 3 5 15 10 0 16 2 4 7 1 14 11 12 13
16 3 9 0 4 6 1 10 13 14 2 8 5 12 15 11 7
4 15 11 6 8 5 13 16 2 3 9 12 7 0 1 10 14
1 12 14 11 13 10 6 15 5 8 7 2 16 9 0 3 4
14 16 6 13 3 2 8 7 12 10 0 15 9 1 4 5 11
7 10 0 1 14 13 4 5 8 11 12 3 2 15 16 6 9
5 11 12 15 7 1 16 6 4 9 8 14 13 3 10 0 2
12 13 16 7 0 14 9 8 11 1 10 6 3 5 2 4 15
2 6 15 16 9 4 7 13 14 0 3 11 8 10 5 1 12
9 5 1 4 11 8 14 2 3 6 15 10 12 16 7 13 0
3 4 5 2 15 9 12 14 0 16 6 1 11 13 8 7 10
11 7 13 8 10 12 3 9 15 5 1 16 0 4 14 2 6
13 0 3 10 2 16 5 1 7 12 14 9 4 11 6 15 8
15 8 7 9 1 11 0 3 6 4 5 13 10 2 12 14 16

J39x3jjhxnHszoQpfcDrAzx27ZgCpvYW9JZU9nm4EozssVGc6mUYnCWuV7HzfwhWK2hEtntURM2pDGa9ins
0 7 12 2 13 14 16 8 11 3 9 5 15 10 6 4 1
4 1 16 11 3 12 13 15 10 0 6 14 9 7 5 2 8
1 5 2 15 10 4 11 12 9 7 13 0 16 6 3 8 14
16 2 6 3 14 9 5 10 0 12 1 15 7 4 8 13 11
11 15 3 7 4 13 0 6 1 2 14 16 5 8 12 10 9
3 10 14 4 16 5 12 1 2 13 15 6 8 11 9 0 7
12 4 9 13 5 15 6 11 3 14 7 8 10 0 1 16 2
13 11 5 0 12 6 14 7 4 16 8 9 1 2 15 3 10
10 9 0 1 2 3 4 5 8 11 12 13 14 15 16 7 6
6 13 1 14 15 7 8 0 12 9 2 10 4 16 11 5 3
14 0 15 16 6 8 9 2 13 5 10 1 11 3 7 12 4
9 16 7 5 8 10 1 3 14 15 4 11 0 12 2 6 13
7 6 4 8 11 0 2 14 15 10 16 3 12 9 13 1 5
5 3 8 12 9 1 15 4 16 6 11 7 2 13 10 14 0
2 8 13 10 0 16 3 9 7 4 5 12 6 1 14 11 15
8 14 11 9 7 2 10 16 6 1 3 4 13 5 0 15 12
15 12 10 6 1 11 7 13 5 8 0 2 3 14 4 9 16

Utility Harry White gived

Order? 17

Enter the name of the squares file: inp
.. writing type information to file inpTypeDetail_8.txt

Counts
------
         4 diagonal Latin
         4 associative
         4 natural \diagonal
         4 self-orthogonal

We have three rules for SN DLS of order 17

1 2 3 4 5 6 7 16 8 0 9 10 11 12 13 14 15
1 2 3 16 5 6 7 12 8 4 9 10 11 0 13 14 15
1 16 3 14 5 12 7 10 8 6 9 4 11 2 13 0 15

The program is called sort.

sort -u <input.txt

Where can I download this program?

Could you include program here?
https://boinc.tbrada.eu/download/ndlk-2101a.zip

https://github.com/bmatzelle/gow/releases
The sort program there is called gsort.exe (windows has program of same name). You can install the whole package (10MB) or copy just the gsort exe with two dlls.
Includes few useful programs, like cut, diff, grep.

We have three rules for SN DLS of order 17

1 2 3 4 5 6 7 16 8 0 9 10 11 12 13 14 15
1 2 3 16 5 6 7 12 8 4 9 10 11 0 13 14 15
1 16 3 14 5 12 7 10 8 6 9 4 11 2 13 0 15

More rules:

1 0 3 2 5 4 7 6 8 10 9 12 11 14 13 16 15
1 0 3 2 5 4 7 6 8 10 9 12 11 14 15 16 13
1 0 3 2 5 4 7 6 8 10 9 12 11 15 16 13 14
1 0 3 2 5 4 7 6 8 10 9 12 11 15 16 14 13
1 0 3 2 5 4 7 6 8 10 9 12 13 11 15 16 14
1 0 3 2 5 4 7 6 8 10 9 12 13 14 15 16 11
1 0 3 2 5 4 7 6 8 10 9 12 13 15 11 16 14
1 0 3 2 5 4 7 6 8 10 9 12 13 15 16 11 14
1 0 3 2 5 4 7 6 8 10 9 12 13 15 16 14 11
1 0 3 2 5 4 7 6 8 10 9 13 14 15 16 11 12
1 0 3 2 5 4 7 6 8 10 9 13 14 15 16 12 11
1 0 3 2 5 4 7 6 8 10 9 13 15 11 16 12 14
1 0 3 2 5 4 7 6 8 10 9 13 15 11 16 14 12
1 0 3 2 5 4 7 6 8 10 9 13 15 12 16 14 11
1 0 3 2 5 4 7 6 8 10 9 13 15 16 12 14 11

https://github.com/bmatzelle/gow/releases
The sort program there is called gsort.exe (windows has program of same name). You can install the whole package (10MB) or copy just the gsort exe with two dlls.
Includes few useful programs, like cut, diff, grep.

Thank you.

I think the CF sorting program should be in your software package.
Moreover, it is better to do the sorting during the canonicalization process. There is no point in displaying duplicates.

I think the CF sorting program should be in your software package.
Moreover, it is better to do the sorting during the canonicalization process. There is no point in displaying duplicates.

Okay, I will add a -u switch to my program, to output only unique and sorted results.

98844 ODLK of order 12:
https://boinc.tbrada.eu/download/DaUay.1994.1-400.txt.gz
From DaUayP5fWmYHjcNNj3JnBN6rQXiMjg6 path (1994,1) to (1994,400). There are estimates 403 million other mates.

98844 ODLK of order 12:
https://boinc.tbrada.eu/download/DaUay.1994.1-400.txt.gz
From DaUayP5fWmYHjcNNj3JnBN6rQXiMjg6 path (1994,1) to (1994,400). There are estimates 403 million other mates.

Do you find ODLS piece by piece?
Fine!

Can't convert e format to d format.

C:\Users\Дом\Downloads\Tomas>dlkconv e <a.txt d >out.txt
Exception: Square Decode error

Only works like this

dlkconv e DLp2o7FyYbsKDAPSQAxx9pXPTZTRwfA d >out.txt

Use

dlkconv es <a.txt ds >out.txt

dlkconv ef a.txt df out.txt

Tomáš Brada
Maybe you changed the program and needs to download it again?