prolog code on conflict of map-coloring-programmingraja

 Aim: Write a program in prolog on conflict of map-coloring.

Software Used: SWI- PROLOG

Description: In mathematics, the famous problem was coloring adjacent planar regions. Two adjacent regions cannot have the same color no matter whatever color we choose. Two regions which share some boundary line are considered adjacent to each other.

coding:

adjacent(1,2).         adjacent(2,1).

adjacent(1,3).         adjacent(3,1).

adjacent(1,4).         adjacent(4,1).

adjacent(1,5).         adjacent(5,1).

adjacent(2,3).         adjacent(3,2).

adjacent(2,4).         adjacent(4,2).

adjacent(3,4).         adjacent(4,3).

adjacent(4,5).         adjacent(5,4).

color(1,red,a).    color(1,red,b).

color(2,blue,a).   color(2,blue,b).

color(3,green,a).  color(3,green,b).

color(4,yellow,a). color(4,blue,b).

color(5,blue,a).   color(5,green,b).

conflict(Coloring) :-

   adjacent(X,Y),

   color(X,Color,Coloring),

   color(Y,Color,Coloring).

conflict(R1,R2,Coloring) :-

   adjacent(R1,R2),

   color(R1,Color,Coloring),

   color(R2,Color,Coloring).

OUTPUT :