MazePath Solver is an easy to use application that uses generic algorithms to find a path.
Each path or potential solution is coded as list of vectors. Each vector has a length and a direction. I have used binary encoding for each vector.
The direction (N, NW, W, SW, S, SE, E, NE) uses 3 bits, and the length 6 bits.
A path has 25 vectors, and the constraints are to reach the target, while avoiding obstacles - if any - as well as minimizing the total length.
The cross-over rate is 60%, the mutation rate is 30%. Elitism is used.
· Java 1.5 or later