In an ${8}$×${8}$ squares chart , we dig out $n$ squares , then we cannot cut a "T"shaped-5-squares out of the surplus chart . Then find the mininum value of $n$ .
Problem
Source:
Tags: combinatorics proposed, combinatorics
chaotic_iak
20.09.2010 05:53
Based on casework, I got $16$. I haven't found the explanation, nor I can sure it is the minimum. Can anyone give an explanation?
B3, B6, C2, C4, C5, C7, D3, D6, E3, E6, F2, F4, F5, F7, G3, G6
.
SpecialBeing2017
18.07.2018 01:56
chaotic_iak wrote: Based on casework, I got $16$. I haven't found the explanation, nor I can sure it is the minimum. Can anyone give an explanation?
B3, B6, C2, C4, C5, C7, D3, D6, E3, E6, F2, F4, F5, F7, G3, G6
. But sorry, 16 is not the smallest. Here is a construction for 14
Attachments:
