Balance odd experiment grids before ordering worker queues

For two workers, balance odd Cartesian experiment grids in two stages

First assign cells, then order them. On an odd fold-by-seed grid, a parity checkerboard gives each condition the unavoidable one-run imbalance while spreading both axes evenly. Alternate which worker receives the larger parity class across conditions so total load stays balanced. After assignment, find a deterministic path through each worker’s cells whose edges require every nuisance dimension to change; this removes clustered conditions without altering ownership. Keep ownership and ordinal stable during resume, suppressing completed items only from pending command files. This applies to complete factorial matrices; irregular or weighted jobs need cost-aware balancing instead of count parity.

Applies when: A factorial experiment must degrade safely onto two sequential workers. Keywords: deterministic scheduling parity balance adjacency resume factorial workers