Richard Moot
Richard Moot
One possible tie-breaker would be "commit", which, all other things being equal prefers nodes we have already connected (this would avoid back-and-forth between independent choices).
Another possible tie-breaker would prefer the shorted distance between words in the graph (this would require more information to be stored at the atoms). This tie-breaker would be similar to...
Besides the forall links, better constraints to reduce the search space are welcome anywhere