Enumerate deterministic split-tree plans
This commit is contained in:
parent
511e188d16
commit
332a7468f6
2 changed files with 141 additions and 2 deletions
|
|
@ -248,6 +248,9 @@ Current pure planner status:
|
|||
- Planner tests now include a deterministic split-tree generator. It builds
|
||||
valid weighted tiling layouts, derives leaf hierarchy metadata, mutates them
|
||||
through supported transitions, and runs the real planner plus exact validator.
|
||||
- The generated tests also include a bounded corpus of supported split-tree
|
||||
transitions across both axes and directions. Each case is planned twice and
|
||||
compared exactly to catch nondeterministic planner output.
|
||||
|
||||
Tests:
|
||||
|
||||
|
|
@ -258,6 +261,7 @@ Tests:
|
|||
- interruption restarts only affected phase groups
|
||||
- reversing direction produces equivalent motion in reverse
|
||||
- accepted and rejected plans expose deterministic strategy explanations
|
||||
- bounded generated split-tree corpus produces identical plans on repeated runs
|
||||
- child waits for parent/container-space phases when moving upward into a
|
||||
toplevel peer position
|
||||
- mono-mode tab switches do not animate, while entering/exiting mono can animate
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue