AUSTRIAN-POLISH 2003 Problem 10
What is the smallest number of tiles which must be placed on a rectangle (each covering exactly unit squares) so that no further tiles can be placed? How many different ways are there of placing the minimal number (so that further tiles are blocked)? What are the answers for a rectangle?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.