[Resolved] Checker request - GC9J6ZX

Hello

I would like to create a challenge requiring to find all region in Belgium with a minimum number of find per region (as described here under), noting that the player can choose which region he/she would like to associate with each requirements.

Here would be the cache description:

GC number : GC9J6ZX

You must have found at least 4094 caches in Belgium spread in the 11 ""regions"" (as per project-gc: Antwerpen, Brabant wallon, Brussels, Hainaut, Liège, Limburg, Luxembourg, Namur, Oost-Vlaanderen, Vlaams-Brabant and West-Vlaanderen). The minimum “found it” per region is driven by the table of the power of 2 (2^n where n, from 1 to 11, is allocated to each region: Region n : Requirement 2^n). You may order the 11 region as you wish. Concretely you end up with a requirement table as follows:

n Region n 2^n Number of required "found it"
1 Region 1 2^1 = 2
2 Region 2 2^2 = 4
3 Region 3 2^3 = 8
4 Region 4 2^4 = 16
5 Region 5 2^5 = 32
6 Region 6 2^6 = 64
7 Region 7 2^7 = 128
8 Region 8 2^8 = 256
9 Region 9 2^9 = 512
10 Region 10 2^10 = 1024
11 Region 11 2^11 = 2048

I have found a challenge checker for 100 finds per region (here it is: https://project-gc.com/Challenges/GC846W3/40940) but this is not excalty what I would need. I guess the easiest way would be to rank the 11 "found it" of the player on the 11 regions and then check that 1st one is 2 or above, 2nd one is 4 or above, ... the 10th one is 1024 or above and the 11th one is 2048 or above.

Should you have any questions, do not hesitate to reach out to me.

Thanks in advance for your support

Kind regards

Xitaclan

Here is the link https://project-gc.com/Challenges/GC9J6ZX/64249

Please test and reply

Everythink is working perfectly. Many thanks