Problem 776. TRON strategy toggle

Like (2)

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Solution 8629370

Submitted on 4 Jul 2022 by GeeTwo

Size: 33
Leading solution size is 33.

This solution is locked. To view this solution, you need to solve the problem first.

This solution is outdated. To rescore this solution, sign in.

Solve This Problem View on Solution Map

1 Comment

1 Comment

GeeTwo on 4 Jul 2022

As I commented elsewhere, only 1198 loops are necessary. The longest path in a square array avoiding adjacent squares is a spiral from a corner to a point near the center. (For odd, a deep slalom gives the same answer.) The number of steps is:
odd: (n^2+2n-3)/2
even:(n^2+2n-4)/2
For 48, this is 1198, not 2500.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 776. TRON strategy toggle

Suggested Problems

More from this Author3

Community Treasure Hunt

Problem 776. TRON strategy toggle

Suggested Problems

More from this Author3

Community Treasure Hunt

Players