-
Notifications
You must be signed in to change notification settings - Fork 0
/
Board.py
159 lines (131 loc) · 4.29 KB
/
Board.py
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
from copy import deepcopy
ROWS = 4
COLS = 4
def no_tuplo(n):
m=n.brd.board
l=correspond_list(m)
t=tuple(l)
return t
def list_to_matrix(list):
matrix=[[0 for l in range(4)] for l in range(4)]
k=0
for i in range(4):
for j in range(4):
matrix[i][j]=list[k]
k+=1
return matrix
def inversions(lista):
inv = 0
for i in range(len(lista)):
for j in range(i+1,len(lista)):
if ((lista[i]>lista[j]) and (lista[i])!=0 and (lista[j])!=0):
inv += 1
return inv
def correspond_list(matriz):
lista = [item for sublist in matriz for item in sublist]
return lista
#board
class Board:
def __init__(self,matrix,goal):
self.goal=goal
self.board=deepcopy(matrix)
self.blank = self.find_blank()#[x,y]
def __repr__(self):
k=0
for i in self.board:
print()
print("+----+----+----+----+")
for j in i:
print("| {:2d} ".format(j), end="")
print("|", end="")
if(k<3):
k += 1
print()
print("+----+----+----+----+")
return ""
def find_blank(self):
for row in range(ROWS):
for col in range(COLS):
if self.board[row][col] == 0:
return [row, col]
def isSolution(self):
if (correspond_list(self.board)==self.goal):
return True
return False
def possible(self):
lista=correspond_list(self.board)
ninv=inversions(lista)
iblank=self.blank[0]
if ((ninv%2)!=(iblank%2)):
return True
return False
#comandos:
def up(self):
if (self.blank[0]>0 and self.blank[0]<=3):
upper=self.board[self.blank[0]-1][self.blank[1]]
self.board[self.blank[0]-1][self.blank[1]]=0
self.board[self.blank[0]][self.blank[1]]=upper
self.blank[0]-=1
return True
return False
def down(self):
if (self.blank[0]<3 and self.blank[0]>=0):
lower=self.board[self.blank[0]+1][self.blank[1]]
self.board[self.blank[0]+1][self.blank[1]]=0
self.board[self.blank[0]][self.blank[1]]=lower
self.blank[0]+=1
return True
return False
def right(self):
if (self.blank[1]<3 and self.blank[1]>=0):
thenext=self.board[self.blank[0]][self.blank[1]+1]
self.board[self.blank[0]][self.blank[1]+1]=0
self.board[self.blank[0]][self.blank[1]]=thenext
self.blank[1]+=1
return True
return False
def left(self):
if (self.blank[1]>0 and self.blank[1]<=3):
theprev=self.board[self.blank[0]][self.blank[1]-1]
self.board[self.blank[0]][self.blank[1]-1]=0
self.board[self.blank[0]][self.blank[1]]=theprev
self.blank[1]-=1
return True
return False
def expand(self,str):
jogo = deepcopy(self)
if str=="left":
val=jogo.left()
if val==False:
return False
elif str=="right":
val=jogo.right()
if val==False:
return False
elif str=="up":
val=jogo.up()
if val==False:
return False
elif str=="down":
val=jogo.down()
if val==False:
return False
return jogo
#heuristicas
def out_of_place(self):
soma = 0
lista = correspond_list(self.board)
for i in range(len(lista)):
if lista[i]!=self.goal[i] and lista[i]!=0:
soma += 1
return soma
def manhattan_distance(self):
distancia = 0
final = list_to_matrix(self.goal)
for i in range(len(self.board)):
for j in range(len(self.board[i])):
if self.board[i][j]!=0 and self.board[i][j] != final[i][j]:
for k in range(len(final)):
if self.board[i][j] in final[k]:
distancia += abs(k - i) + abs(final[k].index(self.board[i][j]) - j)
return distancia