more
main page
analysis page
WOW Applet
SPAM Stats

email me

resources
offline
online



-----

A* (A-star) Algorithm: AI java implemented

This is a project in AI, the applets are a monitor for the A-star Algorithm. They where written by Hernan Guelman (1999).

Below are applets ready to run the A* Algorithm on the 8-Puzzle path find problem. The goal state for the puzzle is:

  • For an analysis on the results and the heuristic functions used please read the analysis page.
  • some good ofline resources you can check out In this page
  • some good online links In this page

Usage:

First Choice box is for the starting state of the Puzzle. 0 is for the empty box.
Second Choice box is for the heuristic function u want to use. "Start" is for running the Algorithm.
After a short time, you will start getting the display of the Solution path found by the computer. and at the end, a statistic output, regarding this run will be printed in the text box below.
If you run this applets from a "weak" computer, (or from a network in the university for ex.) then dont run the heuristic function "number of misplaced tiles" in the same time with other applets since this heuristic takes lots of cpu time and will cause the rest of the applets not to update the screen.

Statistics:

- Nodes generated: How many different states were generated because their parent was developed.
- Avg nodes developed each step: The averagee number of "sons" that one state had. Notice it is smaller then 2 since it can be at most only 3 (not 4) and will be many times much less since it counts only sons that are NEW, that is unvisited sons (or visited but improved, a thing that never happens in this type of problem.)
- Depth of solution - The number of steps frrom start state to goal state.
- Nodes developed: The nodes that we tested and developed all their sons.
- Run time :Elapsed time in milliseconds.

statistics remarks:

*The Elapsed time is for the time it took the computer to calculate the result, NOT show it on screen. that is why it might be some times == ZERO!!. The moves you sea on screen are the winning path AFTER this was calculated and found. (in other words, when you see the moves the calculation is over!).
*The elapsed time may vary in small deltas for CPU load variables, take in consideration this point when comparing different runs.


































Counter

 

1