@@ -35,12 +35,12 @@ Base case: we have two correctly recogni
Issues:
* illegal positions → ignorable
* illegal positions -> ignorable
* positions unreachable from the previous state
* reachable from any past state. (Incorrect states inbetween.) How to pick the correct leaf of such a tree?
* reachable by more than one move. (Lost states inbetween.) Issues with branching factor.
* stone shifts
* stone stops being recognized → fixable manually and even ignorable
* stone stops being recognized -> fixable manually and even ignorable
* stone is recognized at an empty intersection. It can be occupied later for real. What do?
This is handled by the `statebag` package and its documentation also states the problem and used solution in precise terms.
Status change: