Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

8/15 Puzzle using A* (A Star) Algorithm, C#

, 14 Jul 2013 CPOL
8/15 puzzle using A* (A Star) algorithm.

Revisions


  

Compare Revision Minor Date Status Editor
4 - publicly available Yes 14-Jul-13 7:48 Available Sudhir Tiwari
The article has been approved
3 No 14-Jul-13 3:56 Pending Sudhir Tiwari
I have optimized code to use indexed min priority queue. This is to speed-up the lookup and removal of the state from the min priority queue. Revised code is ~11 times faster than the original code.
2 No 6-Jul-13 12:21 Available Smitha Vijayan
Updates in content. Changes: 28
1 No 6-Jul-13 7:13 Pending Sudhir Tiwari
Initial creation

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Sudhir Tiwari
Software Developer CLSA Ltd
Hong Kong Hong Kong
A software developer, working as a Trading Algorithm developer in CLSA. I have been in software industry since November, 2007. I have experience in .NET technologies, C#, C, Java, trading algorithms, machine learning and AI.

| Advertise | Privacy | Terms of Use | Mobile
Web01 | 2.8.1411019.1 | Last Updated 14 Jul 2013
Article Copyright 2013 by Sudhir Tiwari
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid