Presentation Solving on Miller–Schupp benchmark 1190-presentation
640Presentations SolvedGS-SUB (1M) NODES
Evaluation results
| Method | Links | |
|---|---|---|
| GS-SUB (1M) NODESSearch Algorithm=Greedy Search, Move Set=Substitution supermoves, Search Budget (Nodes)=1M2026.06 | 640 | |
| GS-SUB (10M) NODESSearch Algorithm=Greedy Search, Move Set=Substitution supermoves, Search Budget (Nodes)=10M2026.06 | 640 | |
| GS-SUB (100K) NODESSearch Algorithm=Greedy Search, Move Set=Substitution supermoves, Search Budget (Nodes)=100K2026.06 | 634 | |
| PPO-SUB-DRT + AC-19Search Algorithm=PPO, Move Set=Substitution supermoves, Model Architecture=Dual-Ring Transformer, Additional Training Data=AC-192026.06 | 607.2 | |
| PPO-SUB-DRT + AC-1MSearch Algorithm=PPO, Move Set=Substitution supermoves, Model Architecture=Dual-Ring Transformer, Additional Training Data=AC-1M2026.06 | 605.4 | |
| GS-SUB (10K) NODESSearch Algorithm=Greedy Search, Move Set=Substitution supermoves, Search Budget (Nodes)=10K2026.06 | 604 | |
| PPO-SUB-DRTSearch Algorithm=PPO, Move Set=Substitution supermoves, Model Architecture=Dual-Ring Transformer, Preprocessing Strategy=cyclic relative positional encodings2026.06 | 588.2 | |
| PPO-SUB-CANON + AC-19Search Algorithm=PPO, Move Set=Substitution supermoves, Preprocessing Strategy=canonical form preprocessing, Additional Training Data=AC-192026.06 | 575.5 | |
| PPO-SUB-CANONSearch Algorithm=PPO, Move Set=Substitution supermoves, Preprocessing Strategy=canonical form preprocessing2026.06 | 562.6 | |
| GS-AC (1M)Search Algorithm=Greedy Search, Move Set=AC-moves, Search Budget (Nodes)=1M2026.06 | 533 | |
| GS-SUB (614)Search Algorithm=Greedy Search, Move Set=Substitution supermoves, Search Budget (Nodes)=6142026.06 | 533 | |
| PPO-AC-RESNETSearch Algorithm=PPO, Move Set=AC-moves, Model Architecture=ResNet2026.06 | 457 |