optimize-littleman-solutions

What problem does it solve? It re-audits already-solved ICFPC 2026 littleman problems and systematically shrinks their footprint, average ticks, and overall score without breaking correctness on any public test case. ## Core Features & Use Cases - Solution Auditing: Runs a read-only audit script over all problems//.man files, measuring side, average ticks, and score via the lman CLI to establish trustworthy baselines. - Improvement Prioritization: Ranks optimization opportunities using scoring mode (footprint vs footprint-tick), leaderboard gaps from lman rank, and next-side tick break-even ceilings. - Hypothesis-Driven Optimization: Guides creation of separately named candidate .man files, staged verification with lman check/run/test, and NOTES.md updates only when score genuinely improves. - Use Case: Given a solved problem like triangle with an 8x8 solution, audit all candidates, identify that reducing side by one still wins even with more ticks, build a smaller candidate, and verify all public tests pass before recording the new best. ## Quick Start Use the optimize-littleman-solutions skill to audit all solved problems and optimize the one with the most improvement headroom.