Skip to main content

DSL

10: Problem Statement:
A classic problem that can be solved by backtracking is called the Eight Queens problem, which comes from the game of chess. The chess board consists of 64 square arranged in an 8 by 8 grid. The board normally alternates between black and white square, but this is not relevant for the present problem. The queen can move as far as she wants in any direction, as long as she follows a straight line, Vertically, horizontally, or diagonally. Write C++ program with recursive function for generating all possible configurations for 4-queen's problem.
#include<iostream>

using namespace std;

class queen

{

int n;

public:

void read()

{

cout<<"Enter board size\n";

cin>>n;

}

bool place(int x[10],int k)

{

for(int i=1;i<k;i++)

{

if(x[i] == x[k] || i+x[i] == k+x[k] || i-x[i] == k-x[k])

return false;

}

return true;

}

void nqueen()

{

int x[10];

int k=1;

x[k]=0;

while(k!=0)

{

x[k]++;

while((!place(x,k))&&(x[k]<=n))x[k]++;



if(x[k]<=n)

{

if(k == n)

{

cout<<"Solution \n";

print(x);

cout<<endl;

}

else

{

k++;

x[k]=0;

}

}

else

k--;

}

}

void print(int x[10])

{

char c[10][10];

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

{

for(int j=1;j<=n;j++)

c[i][j]='-';

}

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

{

c[i][x[i]]='Q';

}



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

{

for(int j=1;j<=n;j++)

cout<<c[i][j]<<"\t";

cout<<endl<<endl;

}

cout<<endl;

}

};

int main()

{

queen A;

A.read();

A.nqueen();

return 0;

}

Comments

Post a Comment

Popular posts from this blog

DSL

9: Program Setatement A palindrome is a string of character that‘s the same forward and backward. Typically, punctuation, capitalization, and spaces are ignored. For example, ‖Poor Dan is in a droop‖ is a palindrome, as can be seen by examining the characters ―poor danisina droop‖ and observing that they are the same forward and backward. One way to check for a palindrome is to reverse the characters in the string and then compare with them the original-in a palindrome, the sequence will be identical. Write C++ program with functions- 1. to check whether given string is palindrome or not that uses a stack to determine whether a string is a palindrome. 2. to remove spaces and punctuation in string, convert all the Characters to lowercase, and then call above Palindrome checking function to check for a palindrome 3. to print string in reverse order using stack Program: #include<iostream> #include<string.h> #define MAX 100 using namespace std;  struct stack ...
Post a Comment
Read more

DSL

4: Problem Statement: Write C/C++ program for storing matrix. Write functions for  a) Check whether given matrix is upper triangular or not  b) Compute summation of diagonal elements  c) Compute transpose of matrix  d) Add, subtract and multiply two matrices #include<iostream> #include<cstdio> void Upper_Triangular(int a[10][10],int n,int m) { for(int i=0;i<n;i++){ printf("\n"); for(int j=0;j<m;j++) if(i>=j) printf(" %d ",a[i][j]); else printf(" %d ",0); } } void Addition(int a[10][10],int b[10][10],int m,int n) { int c[10][10],i,j; for(i=0;i<m;++i) { for(j=0;j<n;++j) { c[i][j]=0; c[i][j]+=a[i][j]+b[i][j]; } } printf("\nAddition Of two Matrix is : \n"); for(i=0;i<m;++i) { for(j=0;j<n;++j) { printf(" %d ",c[i][j]); } printf("\n"); } } void Dif...
Post a Comment
Read more

OOP

6.Problem statement Develop an object oriented program in C++ to create a database of student  information system containing the following information: Name, Roll number, Class, division, Date of Birth, Blood group, Contact address, telephone number, driving license no. etc Construct the database with suitable member functions for initializing and destroying the data viz constructor, default constructor, Copy constructor, destructor, static member functions, friend class, this pointer, inline code and dynamic memory allocation operators-new and delete. Program #include<iostream> #include<stdio.h> #include<cstring> using namespace std; class personal; static int count; class person {       char *name;       int *rollno,*classno;       char *bloodgroup,*div;                   public:person()              {     ...
Post a Comment
Read more