-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathNReinas.java
73 lines (66 loc) · 2.12 KB
/
NReinas.java
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.List;
public class NReinas {
final int N = 8;
void mostrarResultado(int tablero[][])
{
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++)
System.out.print(" " + tablero[i][j]
+ " ");
System.out.println();
}
}
boolean esSeguro(int tablero[][], int row, int col)
{
int i, j;
for (i = 0; i < col; i++)
if (tablero[row][i] == 1)
return false;
for (i = row, j = col; i >= 0 && j >= 0; i--, j--)
if (tablero[i][j] == 1)
return false;
for (i = row, j = col; j >= 0 && i < N; i++, j--)
if (tablero[i][j] == 1)
return false;
return true;
}
boolean ResolverNReinasUtil(int tablero[][], int col)
{
if (col >= N)
return true;
for (int i = 0; i < N; i++) {
if (esSeguro(tablero, i, col)) {
tablero[i][col] = 1;
if (ResolverNReinasUtil(tablero, col + 1) == true)
return true;
tablero[i][col] = 0; // BACKTRACKIN
}
}
return false;
}
boolean resolverNreinas()
{
int tablero[][] = { { 0, 0, 0, 0,0, 0, 0, 0 },
{ 0, 0, 0, 0,0, 0, 0, 0 },
{ 0, 0, 0, 0,0, 0, 0, 0 },
{ 0, 0, 0, 0,0, 0, 0, 0 },
{ 0, 0, 0, 0,0, 0, 0, 0 },
{ 0, 0, 0, 0,0, 0, 0, 0 },
{ 0, 0, 0, 0,0, 0, 0, 0 },
{ 0, 0, 0, 0,0, 0, 0, 0 } };
if (ResolverNReinasUtil(tablero, 0) == false) {
System.out.print("La Soluci�n no existe");
return false;
}
mostrarResultado(tablero);
return true;
}
public static void main(String args[])
{
NReinas Reina = new NReinas();
Reina.resolverNreinas();
}
}