Could you create a checker for GC42784?

Question

The challenge here is to create a domino with minimum 27 different D/T combinations where the T value of the previous cahce equals the D value of the following AND the last letter of cache name equals the first letter of the following cache.

 

Here is an example:

 

1 hl 1.5/1.0 GC2XQ2E Hier piept's wohl
2 ly 1.0/5.0 GCGRNE Loreley
3 ye 5.0/2.5 GC5KWRT Yuppieverachtende Grüße

Thanks in advance

Answer 1

This is interesting challenge. It's simple, but for the checker will be complicated as there is a big number of combinations to check, so the checker can be slow for someone with many founds.

I'll try to write this checker.

Answer 2

YES, It's done!

http://project-gc.com/Challenges/GC42784/14791

Good news, you have made chain of 50 caches, so you have fulfileld the challenge request

note that the checker cannot try all combination as this can require several minutes or hours of CPU time.

So the number of checks is limited to 10M when the requested chain is found or 25M when is not found.

In case of negative result when max number of tries is reached, the script reports warning that this can be a false negative. The limit of 25M is choose as the time of execution is near the timeout (about 20s).

When the result is positive and the max number of tries (in this case 10M) is reached, the script is finished to save the time, however there can be some longer chain that was not found. However the result is OK, so this is not problem.

Comments

Thanks a lot! This is really great.