3.7.174. Partridge

Denotes the fact that a constraint can be used for solving the Partridge problem: the Partridge problem consists of tiling a square of size n(n+1) 2 by n(n+1) 2 squares of respective sizes

  • 1 square of size 1,

  • 2 squares of size 2,

  • ...聽,

  • n squares of size n.

It was initially proposed by R.聽Wainwright and is based on the identity 11 2 +22 2 +...+nn 2 =(n(n+1) 2) 2 . The problem is described in http://mathpuzzle.com/partridge.html. Figure聽3.7.39 gives a solution for n=12 found with 饾殣饾殠饾殬饾殰饾殱.

Figure 3.7.39. A solution to the Partridge problem for n=12

Download the geost instance for this example in XML or PROLOG format.