About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
May 2024 - Solution
May 2024 Solution:
The numerical solutions are:
* Main problem: 422378820864000
* Bonus:
90399509839271079668491458784005740889517921781547218950513473999637402251071324160000000000000000
There are several approaches to find those numbers; we present only one.
A Dobble-like deck corresponding to a parameter is equivalent to a **projective plane** of order N. This is a set of
points and
lines such that every line contains exactly
points, and every two lines
intersect at exactly one point (think of a projective plane as a generalization of the Euclidean plane, with the difference
that there are no parallel lines).
There is only one projective plane of order 4 and only one of order 8, up to isomorphism. Since we consider isomorphic
decks as distinct if there are cards which differ in their symbols, given a Dobble deck we also need to count all the
distinct Dobble decks obtained from it by taking a perumtation of the symbols in the deck. If the
permutation is an **automorphism** of the deck, we'll double-count the resulting deck, so the solution is obtained by
dividing
by the size of the automorphism group for the corresponding projective plane, which for the
relevant cases are
for
and
for
(these numbers are well known, but can also be
computed via a software package).