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.

 

String_1

 
Tipo de recurso
Actividad
Etiquetas
connected  corners  grid  pattern  picks  random  separate  snake 
Grupo destino (edad)
19+
Idioma
English (United States)
 
 
Versión de GeoGebra
4.2
Vistas
1657
Contacta al autor del recurso
 
 
© 2024 International GeoGebra Institute