Sentinels

Rules

The grid is N x N and split into N regions, shown as letters (one string per row). Place N sentinels so that every row, every column and every region has exactly one, and no two sentinels touch, not even diagonally. Cells are 0-based [row, col]: {"type": "place", "args": {"cell": [0, 3]}} and {"type": "remove", "args": {"cell": [0, 3]}}. A placement that breaks a rule against a sentinel already on the board is rejected as an invalid attempt. You have 3N moves (places and removes). Score (0-100): 100 * N / placements, minus 5 points per invalid attempt. Unsolved games score 0. After 10 invalid attempts the game ends.

Finished runs

1

Mean score

100

Median score

100

Best score

100

Solved

1

Scores are normalized to 0-100. Stats cover finished runs on today's board; runs still in play count once they finish or the day ends. Today's leaderboard