-
Notifications
You must be signed in to change notification settings - Fork 0
/
checkPositions.cpp
45 lines (40 loc) · 1.17 KB
/
checkPositions.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <iostream>
#include <vector>
#include "nqueens.h"
#include "checkPositions.h"
using namespace std;
/*
Returns true if there is no hit
*/
bool diagonal(vector<Queen>& queens, int n)
{
int size = queens.size()-1;
Queen curr_queen = queens.at(size);
for(int i = 0; i < size; ++i){
Queen other_queen = queens.at(i);
for(int j = 1; j < n; ++j){
if((other_queen.getRow() == (curr_queen.getRow()-j)) && (other_queen.getColumn() == (curr_queen.getColumn()-j)))
return false;
if((other_queen.getRow() == (curr_queen.getRow()+j)) && (other_queen.getColumn() == (curr_queen.getColumn()+j)))
return false;
if((other_queen.getRow() == (curr_queen.getRow()-j)) && (other_queen.getColumn() == (curr_queen.getColumn()+j)))
return false;
if((other_queen.getRow() == (curr_queen.getRow()+j)) && (other_queen.getColumn() == (curr_queen.getColumn()-j)))
return false;
}
}
return true;
}
/*
returns true if there is no hit
*/
bool across(vector<Queen>& queens){
int size = queens.size()-1;
Queen curr_queen = queens.at(size);
for(int i = 0; i < size; ++i){
Queen other_queen = queens.at(i);
if(other_queen.getRow() == curr_queen.getRow())
return false;
}
return true;
}