pwnt.be

Saturday, April 15, 2006, 01:24 PM CET

Because Mozaik is a cool game, I’ve taken the liberty of writing a BFS solver for it in Perl—even though I’ve managed to solve all levels without it. Of course, it runs out of memory insanely fast, so it’s only suitable for some levels. A DFS algorithm that stops at the maximum number of allowed twists would probably be less pointless. I might get around to that later. If you’re interested, the BFS version is right here.

Links to This Post

Post a Comment

This contraption supports Gravatar, as well as Markdown with SmartyPants. If none of that made sense to you, feel free to ignore it and start typing.

  • :)
  • :D
  • ;)
  • :-O
  • :P
  • :@
  • :$
  • :S
  • :(
  • :'(
  • :|
  • :-#
  • 8-|
  • ^o)
  • :-*
  • +o(
  • :^)
  • *-)
  • 8-)
  • |-)
Disorientation
Continuity
Retributions
Introducing Pwnt.TagSphere
Tim, John Brand
Lplayer for the Rest of Us
Tim, PixelPirate
Pidgin to Adium Emoticon Theme Converter
Tom, Tim, peter
The HTC Desire Kicks the HTC Legend’s Ass
Tom, Tim, Tom, Tim, Tim, Tom
Google Chrome Still Sucks
smeezekitty, Tim, milosh
Colophonics