{"id":"greedy-skip-optimality","text":"Skipping 3 positions on each `'X'` produces the minimum move count because covering the leftmost uncovered `'X'` first maximizes coverage reach and never wastes a move.","truth_value":"IN","source":"entries/2026/06/06/minimum-moves-to-convert-string-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"greedy-skip-optimality","truth_value":"IN","reason":"premise"}]}}