-
Archives
- October 2018
- August 2016
- July 2016
- April 2015
- December 2014
- August 2014
- June 2014
- February 2014
- November 2013
- August 2013
- July 2013
- May 2013
- April 2013
- March 2013
- October 2012
- July 2012
- May 2012
- February 2012
- December 2011
- August 2011
- July 2011
- May 2011
- April 2011
- August 2010
- November 2009
- May 2009
- July 2007
- June 2006
- May 2006
-
Meta
Monthly Archives: May 2011
Counting small mazes
Before we get into general algorithms for counting mazes, I thought it would be interesting to do some small cases by hand. It’s quite fun to do, and it’ll give us a few numbers to check against the results of … Continue reading
Posted in mazes
3 Comments
Counting mazes: before we begin
If you’re following the maze series, I hope you’re persuaded that thinking about how to count mazes is a reasonable line of attack on the random access problem.
Posted in Mathematics, mazes
Leave a comment
Random access to mazes: plan of attack
In the last post, I explained what I’m trying to do: to assign each maze an index number in such a way that we can generate a maze given its index number, and find out the index number of any … Continue reading
Posted in Mathematics, mazes
Leave a comment
What’s all this about mazes? A statement of intent.
I’m trying something that I think is going to be fun and interesting – and, who knows, maybe even useful. I want to write a program that allows “random access” to all possible mazes, and does it quickly enough to … Continue reading
Posted in algorithms, mazes
5 Comments
Bosker Blog 