Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
This problem was suggested by Lorenzo Gianferrari Pini and Radu-Alexandru Todor - thanks!
Dobble® is a card game in which each card contains eight symbols, and any two Dobble cards in the deck share exactly one symbol. A standard Dobble deck consists of 55 cards and 57 symbols. However, it is possible to have a deck of 57 cards and 57 symbols.
In general, given a number , which is a prime power, it is possible to find a Dobble-like deck where each card contains symbols, and there are cards and symbols in the deck. Dobble itself corresponds to the case .
Your goal: For , find the number of all possible Dobble-like decks with cards and symbols, and symbols per card, where each pair of cards has exactly one common symbol.
A Bonus "*" will be given for finding the number of all possible Dobble-like decks for .
We will post the names of those who submit a correct, original solution! If you don't want your name posted then please include such a statement in your submission!
We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com
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).