Skip to content

Latest commit

 

History

History
32 lines (18 loc) · 968 Bytes

README.md

File metadata and controls

32 lines (18 loc) · 968 Bytes

Map-coloring by Artificial Intelligence

Map coloring problem is a NP hard problem. This problem is solved by local search algorithm. This algorithms are part of Artificial Intelligennce.

Hillclimbing-in-java

The following map is using for this problem Sample Map

Solutions of the Algorithms

Hill Climbing

Hill-Climbing

Simulate Annealing

Simulated Annealing

Passing through the so many steps this algorithm have found this solution for the given map. Simulated Annealing

Genetic Algorithm

Genetic Genetic

Passing through the so many steps this algorithm have found this solution for the given map.

Genetic

Thank You