Ivan Shishkin, Rye (1878)

Problems/CombinatoricsUnreviewed

The truncated chessboard

by Évariste d'aubergine·
20
Difficulty scaleÉchelle de difficulté

This score reflects both the level of the required concepts and the difficulty of the solution.Ce score tient compte à la fois du niveau des notions nécessaires et de la difficulté de la résolution.

  1. 110First steps / middle schoolPremiers pas / collège
  2. 1125Beginner / high schoolDébutant / lycée
  3. 2650Intermediate / undergraduateIntermédiaire / licence
  4. 5170Advanced / graduateAvancé / master
  5. 7190Expert / specializedExpert / spécialisé
  6. 91100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
English
EnglishFrançais
This translation may be outdated. Its source text has changed since revision 3531.
Unreviewed. This problem has not been reviewed by trusted users yet.

Consider a chessboard from which two squares at two diagonally opposite corners have been removed.

Knowing that a domino covers two adjacent squares, is it possible to cover the chessboard with dominoes? In other words, is it possible to cover the entire chessboard with dominoes without any of them overlapping?

Capture d’écran 2026 09 02 à 11.48.50

I solved itMark it doneAdd to my listKeep it in your list

Hints

1

Hint 1

Open this only if you want a small nudge before looking at the solutions.

Solutions

1
Reveal solutionsAre you sure? Give it a try first.
Discussions0 useful votes

If we remove two diagonally opposite corners from the chessboard, it has 30 white squares and 32 black squares, or 32 white squares and 30 black squares. In either case, it is impossible to cover the chessboard, because each domino covers one white square and one black square.

Report

For an unclear, ambiguous, or possibly incorrect statement, please use the Discussion tab on the right. Report content that needs moderator intervention, such as dangerous, clearly non-mathematical, or plagiarized content.