Đang tải bảng tin…
Arthur O'Dwyer0 Hot0 bình luận2 phút đọc
Colourfields
Over on the (inexplicably login-walled) site “NewEnigma,” Keith Austin writes: Draw a 4-by-4 grid. Colour each square red or blue. Select any square, S, and write 1 in it. Then write 1 in every square you can reach from S by a series of moves, where each move is from a square to an adjacent, horizontally, vertically, or diagonally, square of the same colour […] In brief: What is the maximum number of queenwise-connected monochromatic regions you can make by coloring each square of an \(n\times n\) grid either red or blue?
Nguồn: https://quuxplusone.github.io/blog/2026/08/05/colourfields. 8sync News chỉ tóm tắt và dẫn link; bản quyền nội dung thuộc tác giả và nguồn gốc.
