mutilated chessboard problem

Summary

mutilated chessboard problem is a mathematical chess problem^[1]. It draws 108 Wikipedia views per month (mathematical_chess_problem category, ranking #3 of 6).^[2]

Key Facts

• mutilated chessboard problem is credited with the discovery of Max Black^[3].
• mutilated chessboard problem's instance of is recorded as mathematical chess problem^[4].
• mutilated chessboard problem's instance of is recorded as tiling puzzle^[5].
• mutilated chessboard problem's part of is recorded as list of impossible puzzles^[6].
• mutilated chessboard problem's Commons category is recorded as Mutilated chessboard problem^[7].
• mutilated chessboard problem's Freebase ID is recorded as /m/0283z1x^[8].
• mutilated chessboard problem's main subject is recorded as domino tiling^[9].
• mutilated chessboard problem's main subject is recorded as chessboard^[10].
• mutilated chessboard problem's facet of is recorded as graph coloring^[11].
• mutilated chessboard problem's Microsoft Academic ID is recorded as 2779303933^[12].

Body

Works and Contributions

mutilated chessboard problem is credited with the discovery of Max Black^[3].

Why It Matters

mutilated chessboard problem draws 108 Wikipedia views per month (mathematical_chess_problem category, ranking #3 of 6).^[2] It has Wikipedia articles in 9 language editions, a strong signal of global cultural recognition.^[13]