Games - Thirty-six officers problem

Home > Listing Index > Games > Thirty-six officers problem

	Games - Thirty-six officers problem

The thirty-six officers problem is a mathematical puzzle proposed by Leonhard Euler in 1779.

The problem asks if it is possible to arrange 6 regiments consisting of 6 officers each of different ranks in a 6 × 6 square so that no rank or regiment will be repeated in any row or column. Such an arrangement would form a Graeco-Latin square. Euler correctly predicted there was no solution to the dilemma (this was proved by Gaston Tarry in 1901), but the problem has led to important work in combinatorics.

[ Visit the complete Wikipedia entry for Thirty-six officers problem ]

Searches on eBay

thirty-six officers problem