benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / What is the maximum number of colours that can be used to paint an 8×8 chessboard so that every square is painted in a single colour, and is adjacent , horizontally, vertically but…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

What is the maximum number of colours that can be used to paint an 8×88 \times 8 chessboard so that every square is painted in a single colour, and is adjacent , horizontally, vertically but not diagonally, to at least two other squares of its own colour? (A Shapovalov)
Plain-text mathematical notation (without MathML)
What is the maximum number of colours that can be used to paint an 8×8 chessboard so that every square is painted in a single colour, and is adjacent , horizontally, vertically but not diagonally, to at least two other squares of its own colour?

(A Shapovalov)
Original LaTeX notation
What is the maximum number of colours that can be used to paint an $8 \times 8$ chessboard so that every square is painted in a single colour, and is adjacent , horizontally, vertically but not diagonally, to at least two other squares of its own colour?

(A Shapovalov)

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
022e10ee-94ab-5b2a-b49b-4ef5025283c3
task_key
test--022e10ee-94ab-5b2a-b49b-4ef5025283c3
task_revision_id
1
config / split
/ test

Official source

initial import