15 votes

The universal ticket

Very unlikely to be optimal, but got to 120 on my first go: Approach: mess around with the problem until it becomes clear that connectivity of the squares will be the main problem. invent glue, ...
user avatar
  • 68.9k
12 votes

The universal ticket

The previously best-known solution has score of 165, with the following grid: From a clever brute-force search, one can learn that However, you can do better! The ticket achieves a score of
user avatar
  • 759
5 votes

Taking turns adding a number 1,2,3 to a 3x3 matrix without repeating numbers in the rows or columns: does the first player always win?

Alice wins. Strategy:
user avatar
  • 12.2k
4 votes

The universal ticket

Update: Honing in the parameters allowed for a score of 153. This is much closer than I expected to get to the 165 mentioned on the website. original: I decided to go for a brute force approach and ...
user avatar
  • 41
1 vote

Taking turns adding a number 1,2,3 to a 3x3 matrix without repeating numbers in the rows or columns: does the first player always win?

Without regard for strategy, considering cases:
user avatar
  • 1,611

Only top scored, non community-wiki answers of a minimum length are eligible