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.
View Activity View Activity

 

String_1 —

 
Resource Type
Activity
Tags
connected  corners  grid  pattern  picks  random  separate  snake 
Target Group (Age)
19+
Language
English (United States)
 
 
GeoGebra version
4.2
Views
1658
Contact author of resource
License
CC-BY-SA, GeoGebra Terms of Use
 
 
© 2024 International GeoGebra Institute