http://code.msdn.microsoft.com/pathfinding1/Project/ProjectRss.aspxThis is a resource page for a simple implementation of a pathfinding algorithm in C&#35;. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple ...http://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=15<div class="wikidoc"> <h1> New Release! </h1>I added a slightly improved version to the archive here. Not a huge improvement, but improvements in many arenas. You can now adjust paths by <b>adding or removing walls</b> anywhere.<br /> <br /><h1> Pathfinding C# </h1>This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br /><h1> Requirements </h1>It works well in Visual Studio 2008 and I hope the code is easy to understand. It will require .NET 3.5 but you doubtless have that if you are using Visual Studio 2008.<br /> <br /><h1> Screenshots </h1>Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br /><h1> Notes </h1>Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br />The algorithm uses enumerators on 2D arrays.<br /> <br /><h1> Important Links </h1>This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdWed, 29 Oct 2008 00:57:30 GMTUPDATED WIKI: Home 20081029Ahttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=14<div class="wikidoc"> <h1> New Release! </h1>I added a slightly improved version to the archive here. Not a huge improvement, but improvements in many arenas. You can now adjust paths by <b>adding or removing walls</b> anywhere.<br /> <br /><h1> Pathfinding C# </h1>This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br /><h1> Requirements </h1>It works well in Visual Studio 2008 and I hope the code is easy to understand. It will require .NET 3.5 but you doubtless have that if you are using Visual Studio 2008.<br /> <br /><h1> Screenshots </h1>Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br /><h1> Notes </h1>Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br />The algorithm uses enumerators on 2D arrays. I have written a good explanation of this in my article <a href="http://dotnetperls.com/Content/2D-Foreach-Yield.aspx" class="externalLink">http://dotnetperls.com/Content/2D-Foreach-Yield.aspx<span class="externalLinkIcon"></span></a> that might be useful.<br /> <br /><h1> Important Links </h1>This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdSat, 17 May 2008 03:09:05 GMTUPDATED WIKI: Home 20080517Ahttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=13<div class="wikidoc"> <h1> New Release! </h1>I added a slightly improved version to the archive here. Not a huge improvement, but improvements in many arenas. You can now adjust paths by <b>adding or removing walls</b> anywhere.<br /> <br /><h1> Pathfinding C# </h1>This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br /><h1> Requirements </h1>It works well in Visual Studio 2008 and I hope the code is easy to understand. It will require .NET 3.5 but you doubtless have that if you are using Visual Studio 2008.<br /> <br /><h1> Screenshots </h1>Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br /><h1> Notes </h1>Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br />The algorithm uses enumerators on 2D arrays. I have written a good explanation of this in my article <a href="http://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=http%3a%2f%2fdotnetperls.com%2fContent%2f2D-Foreach-Yield.aspx&amp;referringTitle=Home">http://dotnetperls.com/Content/2D-Foreach-Yield.aspx</a> that might be useful.<br /> <br /><h1> Important Links </h1>This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdSat, 17 May 2008 03:08:44 GMTUPDATED WIKI: Home 20080517Ahttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=12<div class="wikidoc"> <h1> New Release! </h1>I added a slightly improved version to the archive here. Not a huge improvement, but improvements in many arenas. You can now adjust paths by <b>adding or removing walls</b> anywhere.<br /> <br /><h1> Pathfinding C# </h1>This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br /><h1> Requirements </h1>It works well in Visual Studio 2008 and I hope the code is easy to understand. It will require .NET 3.5 but you doubtless have that if you are using Visual Studio 2008.<br /> <br /><h1> Screenshots </h1>Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br /><h1> Notes </h1>Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br /><h1> Important Links </h1>This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdSat, 17 May 2008 03:07:21 GMTUPDATED WIKI: Home 20080517Ahttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=11<div class="wikidoc"> <h1> New Release! </h1> <br />I added a slightly improved version to the archive here. Not a huge improvement, but improvements in many arenas. You can now adjust paths by <b>adding or removing walls</b> anywhere.<br /> <br /><h1> Pathfinding C# </h1> <br />This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br /><h1> Requirements </h1> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. It will require .NET 3.5 but you doubtless have that if you are using Visual Studio 2008.<br /> <br /><h1> Screenshots </h1> <br />Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br /><h1> Notes </h1>Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br /><h1> Important Links </h1>This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdSat, 17 May 2008 03:06:03 GMTUPDATED WIKI: Home 20080517Ahttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=10<div class="wikidoc"> <h1> New Release! </h1>I added a slightly improved version to the archive here. Not a huge improvement, but improvements in many arenas. You can now adjust paths by <b>adding or removing walls</b> anywhere.<br /><h1> Pathfinding C# </h1>This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /><h2> Requirements </h2>It works well in Visual Studio 2008 and I hope the code is easy to understand. It will require .NET 3.5 but you doubtless have that if you are using Visual Studio 2008.<br /><h2> Screenshots </h2>Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /><h2> Notes </h2>Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /><h2> Important Links </h2>This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdSat, 17 May 2008 03:05:10 GMTUPDATED WIKI: Home 20080517Ahttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=9<div class="wikidoc"> <h1> New Release! </h1> <br />I added a slightly improved version to the archive here. Not a huge improvement, but improvements in many arenas. You can now adjust paths by <b>adding or removing walls</b> anywhere.<br /> <br /><h1> Pathfinding C# </h1> <br />This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br /><h2> Requirements </h2> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. It will require .NET 3.5 but you doubtless have that if you are using Visual Studio 2008.<br /> <br /><h2> Screenshots </h2> <br />Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br /><h2> Notes </h2> <br />Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br /><h2> Important Links </h2> <br />This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdSat, 17 May 2008 03:04:30 GMTUPDATED WIKI: Home 20080517Ahttp://code.msdn.microsoft.com/pathfinding1/Release/ProjectReleases.aspx?ReleaseId=1031This is the second release. New in this version&#58;<br /><br />&#42; Better code separation in new class<br />&#42; Able to deal with up to 10,000 moves<br />&#42; You can add or remove walls anywhere<br />&#42; New test map<br />&#42; Tiny UI fixesSat, 17 May 2008 03:02:24 GMTCREATED RELEASE: Minotaur Pathfinder 5-16-2008 (May 16, 2008) 20080517Ahttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=8<div class="wikidoc"> <h1> Pathfinding </h1> <br />This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br /><h1> Requirements </h1> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. It will require .NET 3.5 but you doubtless have that if you are using Visual Studio 2008.<br /> <br /><h1> Screenshots </h1> <br />Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br /><h1> Notes </h1> <br />Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br /><h1> Important Links </h1> <br />This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdThu, 15 May 2008 04:59:35 GMTUPDATED WIKI: Home 20080515Ahttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=7<div class="wikidoc"> <h1> Pathfinding </h1> <br />This is a resource page for a simple implementation of a <b>pathfinding</b> algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br /><h1> Requirements </h1> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><h1> Screenshots </h1> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br /><h1> Notes </h1> <br />Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br /><h1> Important Links </h1> <br />This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdSat, 03 May 2008 22:46:23 GMTUPDATED WIKI: Home 20080503Phttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=6<div class="wikidoc"> This is a resource page for a simple implementation of a pathfinding algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br />Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br />This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic. Finally my site has more code at <a href="http://code.google.com/p/dotnetperls-controls/" class="externalLink">http://code.google.com/p/dotnetperls-controls/<span class="externalLinkIcon"></span></a>.<br /> </div>smallenucdSat, 03 May 2008 22:45:22 GMTUPDATED WIKI: Home 20080503Phttp://code.msdn.microsoft.com/pathfinding1/Release/ProjectReleases.aspx?ReleaseId=977This is the first code release. It is functional and works well. It is shown in the screenshots on the project page.<br /><br />Don&#39;t expect a huge amount from it, though. It is not really polished.Sat, 03 May 2008 22:44:20 GMTCREATED RELEASE: A-Star Minotaur Pathfinder (May 03, 2008) 20080503Phttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=5<div class="wikidoc"> This is a resource page for a simple implementation of a pathfinding algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br />Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br />This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code. There are many more articles at my site <a href="http://dotnetperls.com/" class="externalLink">http://dotnetperls.com/<span class="externalLinkIcon"></span></a>, although not any others on this exact topic.<br /> </div>smallenucdSat, 03 May 2008 22:42:28 GMTUPDATED WIKI: Home 20080503Phttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=4<div class="wikidoc"> This is a resource page for a simple implementation of a pathfinding algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. Here are a couple screenshots. The first one shows a simple map, with the path being blue and the two points being red. The two points can be thought of as a monster and a hero.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br />Here is another example. Note that you can click on a square to add a wall, which will cause the path to move.<br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> <br />Maps are stored in plain text. Currently things are very simple but the algorithm works reliably. There is a detailed write up at <a href="http://dotnetperls.com/Content/Pathfinding.aspx" class="externalLink">http://dotnetperls.com/Content/Pathfinding.aspx<span class="externalLinkIcon"></span></a> that you definitely should read if you are interested in this project.<br /> <br />This is not intended to become a huge blockbuster game! I just want to show the algorithm and maybe encourage some programmers to start a new project similar to this. I think you can have fun working with this stuff and I hope you do.<br /> <br />This is .NET 3.5 C# code.<br /> </div>smallenucdSat, 03 May 2008 22:41:36 GMTUPDATED WIKI: Home 20080503Phttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=3<div class="wikidoc"> This is a resource page for a simple implementation of a pathfinding algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. <br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1877" alt="minotaur1.png" /><br /> <br /><img src="http://code.msdn.microsoft.com/Project/Download/FileDownload.aspx?ProjectName=pathfinding1&amp;DownloadId=1878" alt="Minotaur2.png" /><br /> </div>smallenucdSat, 03 May 2008 22:38:31 GMTUPDATED WIKI: Home 20080503Phttp://code.msdn.microsoft.com/pathfinding1/Wiki/View.aspx?title=Home&version=2<div class="wikidoc"> This is a resource page for a simple implementation of a pathfinding algorithm in C#. It uses enumerators and objects to find the shortest distance between two points on a field. It is very simple and not very powerful right now.<br /> <br />The program also contains a way to add walls and save and open different maps. I intend to add more features and enhancements to the app, but I think it would be best to release an early version.<br /> <br />It works well in Visual Studio 2008 and I hope the code is easy to understand. <br /> <br /> </div>smallenucdSat, 03 May 2008 22:37:15 GMTUPDATED WIKI: Home 20080503P