Hacker News new | past | comments | ask | show | jobs | submit login

This algorithm strikes me as seemingly having something in common with a https://en.wikipedia.org/wiki/Disjoint-set_data_structure.

As such, I wonder if you could restate Hindley-Milner type inference in terms of solving "perfect" mazes?




It does indeed. A full disjoint-set implementation is probably overkill, though, since you can throw away the information about the previous row whenever you finish the next row.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: