博学者
Polymath
题目详情
Choose an n -omino (call it T) and place as many copies of it as you can on the 10-by-10 board above.
- An n-omino is a connected region of n cells. You get to choose n.
- Rotations and reflections of T are allowed.
- Copies of T may not overlap with each other.
- Any given copy of T may not be placed over two cells of the same value.
- The score for each copy of T is the product of the cells it covers.
- Your total score is the sum of the scores for your T ‘s.
What’s the highest total score you can get?
Submit your score as your answer, and send us a picture of your solution at polymath-puzzle@janestreet.com
解析
Original Explanation
As most solvers realized, it was better to try and use a large n with fewer n-ominoes than a smaller n with many n-ominoes. The top score we received from a handful of solvers was 20,160. Interestingly, there are (at least) 2 different ways of getting to this score — one way is presented here, see if you can find the other!
Congratulations to Wouter Bosma, one of the 20,160 submitters, and this month’s randomly-chosen winner of a Jane Street t-shirt!