Illustration of connected-path-algorithm for 3x3 grid
The question is how many edges in a 3x3 grid can be removed at random before paths from lower left to upper right are disconnected.
- Target Group (Age)
- 19+
- Language
- English (United States)
Error
A timeout occurred. Trying to re-save …
Sorry, but the server is not responding. Please wait a few minutes and then try to save again.