I apologize for not posting sooner... the forum went kaput when I pressed "Post Reply" yesterday. :P

I'm not sure I'm having success with the self-generated work units. Are they supposed to run for over 2 hours per family/name/instance? On a Ryzen 1600X.

---

Are they supposed to run for over 2 hours per family/name/instance? On a Ryzen 1600X.

I think it is very slow.

See my example here
https://boinc.multi-pool.info/latinsquares/forum_thread.php?id=57&postid=491#491

One family on my slow computer (2.4 GHz) is checked for a few minutes.

You can use the check.bat script from block #14
https://cloud.mail.ru/public/MGBG/gQRkqp4ec

Replace wu141, wu142, ..., wu150 with family_4_31_31_ <...> _ <...> .txt

Keep in mind that every WU from block #14 produces solutions, but not every family from names_44323p_21332.txt produces solutions.

Thats what i am doing and on my i7-5960X (3.3 GHz) it runs ca. 5min per one family

My changes to the program will be available from now on on this location: https://github.com/gridcoin-community/odlk-progs

---

My changes to the program will be available from now on on this location: https://github.com/gridcoin-community/odlk-progs

Thanks!

Now there is the English version of the family_mar.exe program that XAVER asked about?

By the way is there an english version of family_mar.exe?

Happy New Year to all!

I will give you my Christmas tree :)

Now there is the English version of the family_mar.exe program that XAVER asked about?

No english version yet. I haven't yet looked thru the forum so I do not have it. I can easily translate the messages to english, if i won't find it.
I am writing change description in the commit message.

Dear participants of the autonomous subproject!

While you're running the experiment (checking families from the names_44323p_21333.txt file), I’ll return to my “pseudo-associative DLSs” experiment.
You have already performed this experiment. I generated 14 blocks WUs (140 WUs in total). All WUs checked and gave excellent results.

We will continue this experiment if you want.

I developed this experiment in December 2017 and immediately began performing it on my PC.
I found in this experiment a unique solution - DLS, which has 10 orthogonal DLS
https://boinc.progger.info/odlk/forum_thread.php?id=1&postid=1742#1742

This solution is noted in OEIS.
See article
Maximum square number of orthogonal diagonal squares for one diagonal square.
https://oeis.org/A287695

I developed a new pseudo-associative DLSs generator for my experiment.
I generate two sets of pseudo-associative DLSs at once — the first generator and the second generator.
These sets intersect, but the first set (the smaller one) is not included full in the second set.
I make the union of these sets. Thus, I get a set of pseudo-associative DLSs that need to be checked by the family_mar.exe program.

Now I am preparing a script to test the experiment with two generators.

For example
pseudo-associative DLS obtained by the first generator



See message
https://boinc.progger.info/odlk/forum_thread.php?id=1&postid=1850#1850

Show pseudo-associative DLS from the second generator?

ice00
you rewrote my first generator on C++
The experience was unsuccessful. You have not completed this work. The generator does not work in your version. So?

Unfortunately, the second generator is also written in BASIC.
I do not write programs in other languages.

If someone wants to try rewriting my programs on C++, please write to me.

Remind everyone

now you select for checking familys names from the names_44323p_21332.txt file starting with family #15426 - IIEWDRATK.

It remains to check 5907 families.

Now i am checking IIEWDRATK to IIEWFSILB. For me it is easier to do 100 families in one file then the next 100 and so on.

Kind regards
XAVER

XAVER
I received and processed your results (results_xav02.txt).
Found 86 unique CFs ODLS.

All is well.
Thanks!

Now i am checking IIEWDRATK to IIEWFSILB. For me it is easier to do 100 families in one file then the next 100 and so on.

Good.

Remind everyone

now you select for checking familys names from the names_44323p_21332.txt file starting with family #15651 - IIEWFSOFH.

It remains to check 5682 families.

I offer a little test.

For the operation of two generators in my experiment "pseudo-associative DLSs" is given a set of 8 numbers.
For example

4 3 7 2 1 9 5 6

Let's call this set - a row.
Each row gives one WU.
The row is written to the file A18.txt.

Unzip the archive and run the gener_check.bat script

1. The first generator ASS_DLK10A.exe (my program) works;
2. The second generator PSEVDOASS_DLK_new.exe (my program) is working;
3. Two sets of DLSs are combined, the program kanonizator_dlk_1.03.exe by Belyshev is used;
4. The DLSs set is check using the program family_mar.exe of Belyshev.

The results will be written to the file output.txt.
Programs works in the Windows system.

On my computer checking one WU is done 3-4 hours.

Please check this test.
If all is well, you can start this experiment.
Rows for WUs I will send on request.

Link
https://cloud.mail.ru/public/FABN/hU8fFevUD

I am continuing with IIEWFSOFH to IIEWNEGVK

Kind regards
XAVER

P.S.: I am also testing your new experiment

Further continuing with IIEWNEILT to IIEWQJFSG

Kind regards
XAVER

Further continuing with IIEWNEILT to IIEWQJFSG

XAVER
you check
with IIEWDRATK to IIEWQJFSG (#15426 - #15850) is 425 families

So?

P.S.: I am also testing your new experiment

Thanks!
Please tell us about the test results.

So for the test i have to copy first A18.txt into a.txt. Correct? Because a.txt is empty after extracting from the zip file.

Kind regards
XAVER