- For n = 10, 12, ..., 50, construct a maximal partial Room square using both greedy1 and greedy2 but with cells visited in random order and pairs chosen at random.
- Plot volumes achieved with five different seed values per order and algorithm (random greedy1 and random greedy2).
- Table summarises maximum and minimal values per order.
- R 4.4.1
- renv 1.0.7, targets 1.7.1, wallis 0.0.0.9007