mirror of
https://github.com/ajisaacs/OpenNest.git
synced 2026-11-02 14:51:35 -05:00
ajandClaude Opus 5.5
16bd92567c
When a part could not be reached without crossing parts already cut, the free search always learned "cut the blocked part before them". When the crossed part was the one cut just before the part the tool left from, the tool had gone on past it and come back: the cheap repair is to cut those two the other way round. Without it, N26-23S learned a chain of wrong rules (8 before 4 and 5, 3 before 1, ...) that excluded every valid order and ran the full search out of budget, although swapping parts 5 and 6 gives a valid plan. It now plans ready in 786 expansions. The problem-nest corpus keeps every outcome; three P260417-17 plates stay Ready with more expansions (5341 -> 8937 the largest). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>