<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Maze Solving on bradleycarey.com</title>
    <link>https://bradleycarey.com/tags/maze-solving/</link>
    <description>Recent content in Maze Solving on bradleycarey.com</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Tue, 05 Dec 2023 14:05:41 -0500</lastBuildDate>
    <atom:link href="https://bradleycarey.com/tags/maze-solving/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Maze Solving Algorithms – Wall Follower</title>
      <link>https://bradleycarey.com/posts/2012-08-15-maze-solving-algorithms-wall-follower/</link>
      <pubDate>Wed, 15 Aug 2012 10:44:53 -0400</pubDate>
      <guid>https://bradleycarey.com/posts/2012-08-15-maze-solving-algorithms-wall-follower/</guid>
      <description>&lt;p&gt;Maze solving algorithms are a well known area of research. Of these, one of the most well known solving strategies for simply connected mazes is the &lt;a href=&#34;http://en.wikipedia.org/wiki/Maze_solving_algorithm#Wall_follower&#34;  class=&#34;external-link&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;wall follower&lt;/a&gt; algorithm. This post will delve into the coding and implementation of such an algorithm (in C#, of course).&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
