Scribd Logo
Upload

Welcome to Scribd!

  • Aim: 8 Queens Problem Using Prolog Source Code:: Artificial Intelligence Lab

    Uploaded by

    Anjali Rai
    24 views2 pages
    The document describes an 8 queens problem solved using Prolog. It defines predicates like safe, solution, permutation, del, and noattack. The solution predicate uses permutation to generate all possible queen placements on an 8x8 board and checks if the placement is safe using the safe predicate. The safe predicate uses noattack to ensure no two queens are attacking each other.

    Original Description:

    Original Title

    8 queens

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an 8 queens problem solved using Prolog. It defines predicates like safe, solution, permutation, del, and noattack. The solution predicate uses permutation to generate all possible queen placements on an 8x8 board and checks if the placement is safe using the safe predicate. The safe predicate uses noattack to ensure no two queens are attacking each other.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    24 views2 pages

    Aim: 8 Queens Problem Using Prolog Source Code:: Artificial Intelligence Lab

    Uploaded by

    Anjali Rai
    The document describes an 8 queens problem solved using Prolog. It defines predicates like safe, solution, permutation, del, and noattack. The solution predicate uses permutation to generate all possible queen placements on an 8x8 board and checks if the placement is safe using the safe predicate. The safe predicate uses noattack to ensure no two queens are attacking each other.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Artificial Intelligence Lab.

    Program
    Akanksha Khurana(IT 8303)

    Aim: 8 Queens problem using prolog

    Source Code:
    domains
    H=integer
    T=integer*
    predicates
    safe(T)
    solution(T)
    permutation(T,T)
    del(H,T,T)
    noattack(H,T,H)
    clauses
    del(I,[I|L],L).
    del(I,[F|L],[F|L1]):-
    del(I,L,L1).
    permutation([],[]).
    permutation([H|T],PL):-
    permutation(T,PT),
    del(H,PL,PT).
    solution(Q):-
    permutation([1,2,3,4,5,6,7,8],Q),
    safe(Q).
    safe([]).
    safe([Q|Others]):-
    safe(Others),
    noattack(Q,Others,1).
    noattack(_,[],_).
    noattack(Y,[Y1|Ydist],Xdist):-
    Y1-Y<>Xdist,
    Y-Y1<>Xdist,
    Dist1=Xdist+1,
    noattack(Y,Ydist,Dist1).
    Artificial Intelligence Lab.
    Program
    Akanksha Khurana(IT 8303)

    Output:-

    You might also like