16
votes
Accepted
8x8 grid with no unmarked L-pentomino
I think the answer is
cells. One way to achieve it is as follows:
There is a straightforward proof that this is the minimum possible.
Bonus for some other pentominoes:
6
votes
3
votes
Covering an 8x8 grid with X pentominoes
This problem can also be called
Plugging in 8 for n, we get
1
vote
Accepted
Rubik's Cube with no two squares of the same color on any horizontal, vertical or diagonal line
Since the bounty has ended and nobody tackled question 2 I will show my way of solving this part (which obviously solves question 1 too).
First we observe that it is impossible to put two stickers of ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
combinatorics × 814mathematics × 499
logical-deduction × 92
optimization × 91
geometry × 71
chess × 49
no-computers × 44
checkerboard × 40
strategy × 38
tiling × 37
probability × 34
graph-theory × 30
calculation-puzzle × 29
weighing × 24
reachability × 23
algorithm × 21
polyomino × 20
visual × 19
computer-puzzle × 19
game × 17
number-theory × 16
primes × 12
dissection × 11
grid-deduction × 10
magic-square × 10