Scribd
Upload
11 views

Lab 11

Uploaded by

danish mahajan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Lab 11

Uploaded by

danish mahajan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

LAB – 11

Program 1: N Queen Problem

#include<iostream>

#include<vector>

using namespace std;

bool safe(int ri, int ci, vector<vector<int> >& chessBoard, int n) {

int tempx = ri, tempy = ci - 1;

while(tempy >= 0) {

if(chessBoard[tempx][tempy]) return false;

tempy--;

tempx = ri - 1, tempy = ci - 1;

while(tempx >= 0 && tempy >= 0) {

if(chessBoard[tempx][tempy]) return false;

tempx--;

tempy--;

tempx = ri + 1, tempy = ci - 1;

while(tempx < n && tempy >= 0) {

if(chessBoard[tempx][tempy]) return false;

tempx++;

tempy--;

}
return true;

void func(int ci, vector<vector<int> >& chessBoard, vector<vector<int> > &ans, int n) {

if(ci == n) {

vector<int> temp;

for(int i = 0;i < n;i++) {

for(int j = 0;j < n;j++) {

temp.push_back(chessBoard[i][j]);

ans.push_back(temp);

return;

for(int i = 0;i < n;i++) {

if(safe(i, ci, chessBoard, n)) {

chessBoard[i][ci] = 1;

func(ci + 1, chessBoard, ans, n);

chessBoard[i][ci] = 0;

int main() {
int n;

cout << "Enter the size of the board : ";

cin >> n;

vector<vector<int> > chessBoard(n, vector<int>(n));

vector<vector<int> > ans;

func(0, chessBoard, ans, n);

for(int i = 0;i < ans.size();i++) {

cout << i + 1 << " Solution : ";

for(int j = 0;j < ans[i].size();j++) {

if(j%n == 0) cout << endl;

cout << ans[i][j];

cout << endl;

}
OUTPUT:

You might also like