oue's profile

The A* Algorithm represent by 8 Puzzle.

Modify the simple A* from
Different Distance = RouteCount + distToGoal
to
Different Distance = RouteCount + distToGoal – distToInitial

RouteCount = Cost to current state
distToGoal = Estimated cost between possible state with
coordinates (x1, y1) and goal state at (x2, y2)
|x1 – x2| + |y1 – y2|

distToInitial = Estimated cost between possible state with
coordinates (x1, y1) and initial state at (x2, y2)
|x1 – x2| + |y1 – y2|

How to :

Let’s play !!

Tools & Knowledge :
1. C#
2. A* Algorithm

Reqirement :
1. Microsoft .Net Framework 2.0 (22.4 MB)
2. windows

Download :
1. 8 Puzzle Program
2. 8 Puzzle Document
3. 8 Puzzle Source Code

No related posts.

Related posts brought to you by Yet Another Related Posts Plugin.