10 Feb
2014
10 Feb
'14
8:02 p.m.
Draw a maze on a two-dimensional n x n grid by erecting a wall between each pair of adjacent (ie, distance one) lattice points independently with probability p. Eyeballing these things in Mathematica, it looks to me like if p < 1/2, there tends to be one "large component" that connects almost all the cells that are not walled off into "locally small" (say 1x1 or 1x2) walled gardens. I'm sure I can't be the first to have considered something like this. I'd welcome information about prior work. -- Thane Plambeck tplambeck@gmail.com http://counterwave.com/