Scribd
Upload
10 views3 pages

Daa Lab - 10

This program implements the N queens problem using backtracking. It takes the number of queens as input, places them on the board one by one while checking for conflicts, and prints out the solutions. It uses functions to check placement, print the board, and recursively try queen placements.

Uploaded by

sri lakshmi Hima Bindu batchu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views3 pages

Daa Lab - 10

This program implements the N queens problem using backtracking. It takes the number of queens as input, places them on the board one by one while checking for conflicts, and prints out the solutions. It uses functions to check placement, print the board, and recursively try queen placements.

Uploaded by

sri lakshmi Hima Bindu batchu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

DAA LAB!!

QUESTION 10: IMPLEMENT N QUEENS PROBLEM USING BACKTRACKING!..


--N QUEENS problem..
PROGRAM:
#include<stdio.h>

#include<math.h>

int board[20],count;

int main()

int n,i,j;

void queen(int row,int n);

printf(" - N Queens Problem Using Backtracking -");

printf("\n\nEnter number of Queens:");

scanf("%d",&n);

queen(1,n);

return 0;

void print(int n)

int i,j;

printf("\n\nSolution %d:\n\n",++count);

for(i=1;i<=n;++i)

printf("\t%d",i);

for(i=1;i<=n;++i)

printf("\n\n%d",i);

for(j=1;j<=n;++j) //for nxn board

if(board[i]==j)

printf("\tQ"); //queen at i,j position


else

printf("\t-"); //empty slot

/*funtion to check conflicts

If no conflict for desired postion returns 1 otherwise returns 0*/

int place(int row,int column)

int i;

for(i=1;i<=row-1;++i)

//checking column and digonal conflicts

if(board[i]==column)

return 0;

else

if(abs(board[i]-column)==abs(i-row))

return 0;

return 1; //no conflicts

//function to check for proper positioning of queen

void queen(int row,int n)

int column;

for(column=1;column<=n;++column)

if(place(row,column))

board[row]=column; //no conflicts so place queen

if(row==n) //dead end

print(n); //printing the board configuration

else //try queen with next position

queen(row+1,n);
}

OUTPUT:

You might also like