♛ Q(20)
N-Queens
counting.
How many ways can twenty queens share a board without any two attacking? The exact count is a hard combinatorial search. Each browser enumerates one small subtree of the search tree and returns its exact size; the server seals a subtree only when it can reproduce the count or two independent browsers agree.
YOUR CONTRIBUTION
IDLEN-Queens workbench
CPU-only: this is an exact, branch-and-bound enumeration. GPU screening cannot prove a count, so the work stays in a dedicated BigInt worker.
Idle. No board is being enumerated.
No subtree assigned0% of cohort
LAST SUBTREE—
ITS SOLUTIONS—
YOUR CONFIRMED0
YOUR SUBMITTED0
A subtree of the 20-queen tree is far larger than the server will enumerate on demand, so it is sealed only after two independent browsers return the same count and the same order-independent FNV-1a fingerprint. Small subtrees are reproduced exactly by the server itself.
Exact counts only
For a leased four-row prefix, the worker walks every completion to row twenty, counting boards and hashing each finished placement. It returns a total and a 64-bit fingerprint — never a partial or approximate answer.
Two ways to seal
Small subtrees are recounted by the server, which rejects any mismatch outright. Large subtrees are accepted only when a second, independent browser produces the identical count and fingerprint, so no single worker can advance the frontier alone.