Problem #PRU-115449
Problemas
Métodos
Principio del casillero
Principio del casillero (número finito de puntos, líneas, etc.)
Matemáticas Discretas
Combinatoria
Descomposiciones, particiones, coberturas y teselaciones
Teselaciones con fichas ordinarias y de dominó
Problem
On an 8×8 grid (like a chessboard), an L-corner is a shape made of 3 little squares of the board that touch to make an L. You can turn the L any way you like. We place the L-corners so that none overlap. What is the fewest L-corners you must place so that no more L-corners can be added anywhere? Here is an example of how three L-corners may look like:
To see the solution register and get verified.