Re: [FRIAM] Watching a Moose solve a Maze Re: solving mazes

Thanks, man! I will take a look and let you know if any ideas pan out. It is a pretty cool model and I am having a bunch of fun watching the little blobs work their way through the "maze". -- Sent from: http://friam.471366.n2.nabble.com/ - . -..-. . -. -.. -..-. .. ... -..-. . .-. . F

Re: [FRIAM] Watching a Moose solve a Maze Re: solving mazes

https://arxiv.org/abs/1508.05647 From: Friam On Behalf Of cody dooderson Sent: Monday, March 1, 2021 10:52 AM To: The Friday Morning Applied Complexity Coffee Group ; Angel Edward Subject: Re: [FRIAM] Watching a Moose solve a Maze Re: solving mazes @Jonzingale. I think you are talking about

Re: [FRIAM] Watching a Moose solve a Maze Re: solving mazes

@Jonzingale. I think you are talking about the Cellular Potts page. The code for it is on Github, https://github.com/m0ose/onepagers/blob/master/potts2.html. I spent a lot of time tweaking values and just staring at that model. I don't know enough about DLA to make a good comparison. Maybe it is si

Re: [FRIAM] Watching a Moose solve a Maze Re: solving mazes

/Note that this is really slow. Is there a higher performance version of this algorithm?/Cody, This statement piqued my interest. Is there somewhere I can see your code? If this algorithm is anything like /diffusion limited aggregation/ (which at a glance it likely might be) then I suspect there re

Re: [FRIAM] Watching a Moose solve a Maze Re: solving mazes

I used to give this problem to my graphics students. Here’s one 2D version https://drive.google.com/drive/folders/1fTNJb4hhgR-6LySQspgM9k-J27KwuLpl?usp=sharing It will generate a new maze each time it’s reru