-
Notifications
You must be signed in to change notification settings - Fork 0
/
BPM_8Puzzle.hs
240 lines (219 loc) · 12 KB
/
BPM_8Puzzle.hs
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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
-- BPM_8Puzzle.hs
-- El problema del 8 puzzle por BPM.
-- José A. Alonso Jiménez https://jaalonso.github.com
-- =====================================================================
module Tema_23.BPM_8Puzzle where
-- Hay que elegir una importación:
-- import Tema_23.BusquedaPrimeroElMejor
import I1M.BusquedaPrimeroElMejor
import Data.Array
-- Representación del problema:
-- ============================
-- Nota: La representación del problema está copiado de
-- BusquedaEnEspaciosDeEstados.hs
-- Una posición es un par de enteros.
type Posicion = (Int,Int)
-- Un tablero es un vector de posiciones, en el que el índice indica el
-- elemento que ocupa la posición.
type Tablero = Array Int Posicion
-- inicial8P es el estado inicial del 8 puzzle. En el ejemplo es
-- +---+---+---+
-- | 2 | 6 | 3 |
-- +---+---+---+
-- | 5 | | 4 |
-- +---+---+---+
-- | 1 | 7 | 8 |
-- +---+---+---+
inicial8P :: Tablero
inicial8P = array (0,8) [(2,(1,3)),(6,(2,3)),(3,(3,3)),
(5,(1,2)),(0,(2,2)),(4,(3,2)),
(1,(1,1)),(7,(2,1)),(8,(3,1))]
-- final8P es el estado final del 8 puzzle. En el ejemplo es
-- +---+---+---+
-- | 1 | 2 | 3 |
-- +---+---+---+
-- | 8 | | 4 |
-- +---+---+---+
-- | 7 | 6 | 5 |
-- +---+---+---+
final8P :: Tablero
final8P = array (0,8) [(1,(1,3)),(2,(2,3)),(3,(3,3)),
(8,(1,2)),(0,(2,2)),(4,(3,2)),
(7,(1,1)),(6,(2,1)),(5,(3,1))]
-- (distancia p1 p2) es la distancia Manhatan entre las posiciones p1 y
-- p2. Por ejemplo,
-- distancia (2,7) (4,1) == 8
distancia :: Posicion -> Posicion -> Int
distancia (x1,y1) (x2,y2) = abs (x1-x2) + abs (y1-y2)
-- (adyacente p1 p2) se verifica si las posiciones p1 y p2 son
-- adyacentes. Por ejemplo,
-- adyacente (3,2) (3,1) == True
-- adyacente (3,2) (1,2) == False
adyacente :: Posicion -> Posicion -> Bool
adyacente p1 p2 = distancia p1 p2 == 1
-- (todosMovimientos t) es la lista de los tableros obtenidos
-- aplicándole al tablero t todos los posibles movimientos; es decir,
-- intercambiando la posición del hueco con sus adyacentes. Por ejemplo,
-- λ> inicial8P
-- array (0,8) [(0,(2,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))]
-- λ> todosMovimientos inicial8P
-- [array (0,8) [(0,(3,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(2,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))],
-- array (0,8) [(0,(1,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))],
-- array (0,8) [(0,(2,3)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,2)),(7,(2,1)),(8,(3,1))],
-- array (0,8) [(0,(2,1)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,2)),(8,(3,1))]]
todosMovimientos :: Tablero -> [Tablero]
todosMovimientos t = [t//[(0,t!i),(i,t!0)] | i<-[1..8], adyacente (t!0) (t!i)]
-- Los nodos del espacio de estados son listas de tableros [t_n,...,t_1]
-- tal que t_i es un sucesor de t_(i-1).
newtype Tableros = Est [Tablero] deriving Show
-- (sucesores8P e) es la lista de sucesores del estado e. Por ejemplo,
-- λ> sucesores8P (Est [inicial8P])
-- [Est [array (0,8) [(0,(3,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(2,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))],
-- array (0,8) [(0,(2,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))]],
-- Est [array (0,8) [(0,(1,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))],
-- array (0,8) [(0,(2,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))]],
-- Est [array (0,8) [(0,(2,3)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,2)),(7,(2,1)),(8,(3,1))],
-- array (0,8) [(0,(2,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))]],
-- Est [array (0,8) [(0,(2,1)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,2)),(8,(3,1))],
-- array (0,8) [(0,(2,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))]]]
sucesores8P :: Tableros -> [Tableros]
sucesores8P (Est(n@(t:ts))) =
filter (noEn ts) [ Est (t':n) | t' <- todosMovimientos t]
where noEn ts' (Est(t':_)) = elems t' `notElem` map elems ts'
noEn _ _ = error "Imposible"
sucesores8P _ = error "Imposible"
esFinal8P :: Tableros -> Bool
esFinal8P (Est (n:_)) = elems n == elems final8P
esFinal8P _ = error "Imposible"
-- Heurísticas
-- ===========
-- (heur1 t) es la suma de la distancia Manhatan desde la posición de
-- cada objeto del tablero a su posición en el estado final. Por
-- ejemplo,
-- heur1 inicial8P == 12
heur1 :: Tablero -> Int
heur1 b = sum [distancia (b!i) (final8P!i) | i <- [0..8]]
-- Dos estados se consideran iguales si tienen la misma heurística.
instance Eq Tableros
where Est(t1:_) == Est(t2:_) = heur1 t1 == heur1 t2
_ == _ = error "Imposible"
-- Un estado es menor o igual que otro si tiene una heurística menor o
-- igual.
instance Ord Tableros where
Est (t1:_) <= Est (t2:_) = heur1 t1 <= heur1 t2
_ <= _ = error "Imposible"
-- (buscaPM_8P) es la lista de las soluciones del 8 puzzle por búsqueda
-- primero el mejor. Por ejemplo,
-- λ> head buscaPM_8P
-- (Est [array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(3,1)),(6,(2,1)),(7,(1,1)),(8,(1,2))],
-- array (0,8) [(0,(2,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(3,1)),(6,(2,2)),(7,(1,1)),(8,(1,2))],
-- array (0,8) [(0,(1,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(3,1)),(6,(2,2)),(7,(2,1)),(8,(1,2))],
-- array (0,8) [(0,(1,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(3,1)),(6,(2,2)),(7,(2,1)),(8,(1,1))],
-- array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(3,1)),(6,(1,2)),(7,(2,1)),(8,(1,1))],
-- array (0,8) [(0,(2,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(3,1)),(6,(1,2)),(7,(2,2)),(8,(1,1))],
-- array (0,8) [(0,(3,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(1,2)),(7,(2,2)),(8,(1,1))],
-- array (0,8) [(0,(3,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(2,1)),(6,(1,2)),(7,(2,2)),(8,(1,1))],
-- array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(2,1)),(6,(1,2)),(7,(3,2)),(8,(1,1))],
-- array (0,8) [(0,(1,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(2,1)),(6,(2,2)),(7,(3,2)),(8,(1,1))],
-- array (0,8) [(0,(1,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(2,1)),(6,(2,2)),(7,(3,2)),(8,(1,2))],
-- array (0,8) [(0,(2,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(1,1)),(6,(2,2)),(7,(3,2)),(8,(1,2))],
-- array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(1,1)),(6,(2,1)),(7,(3,2)),(8,(1,2))],
-- array (0,8) [(0,(3,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(1,1)),(6,(2,1)),(7,(2,2)),(8,(1,2))],
-- array (0,8) [(0,(3,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,1)),(6,(2,1)),(7,(2,2)),(8,(1,2))],
-- array (0,8) [(0,(2,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,1)),(6,(3,1)),(7,(2,2)),(8,(1,2))],
-- array (0,8) [(0,(1,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(3,1)),(7,(2,2)),(8,(1,2))],
-- array (0,8) [(0,(1,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(3,1)),(7,(2,2)),(8,(1,1))],
-- array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(3,1)),(7,(1,2)),(8,(1,1))],
-- array (0,8) [(0,(2,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,2)),(6,(3,1)),(7,(1,2)),(8,(1,1))],
-- array (0,8) [(0,(3,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,2)),(6,(2,1)),(7,(1,2)),(8,(1,1))],
-- array (0,8) [(0,(3,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(2,2)),(6,(2,1)),(7,(1,2)),(8,(1,1))],
-- array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(3,2)),(6,(2,1)),(7,(1,2)),(8,(1,1))],
-- array (0,8) [(0,(2,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(3,2)),(6,(2,2)),(7,(1,2)),(8,(1,1))],
-- array (0,8) [(0,(1,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(3,2)),(6,(2,2)),(7,(1,2)),(8,(2,1))],
-- array (0,8) [(0,(1,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(3,2)),(6,(2,2)),(7,(1,1)),(8,(2,1))],
-- array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(3,2)),(6,(1,2)),(7,(1,1)),(8,(2,1))],
-- array (0,8) [(0,(2,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,1)),
-- (5,(3,2)),(6,(1,2)),(7,(1,1)),(8,(2,2))],
-- array (0,8) [(0,(3,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(2,1)),
-- (5,(3,2)),(6,(1,2)),(7,(1,1)),(8,(2,2))],
-- array (0,8) [(0,(3,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(2,1)),
-- (5,(3,1)),(6,(1,2)),(7,(1,1)),(8,(2,2))],
-- array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(2,1)),
-- (5,(3,1)),(6,(1,2)),(7,(1,1)),(8,(3,2))],
-- array (0,8) [(0,(2,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(2,2)),
-- (5,(3,1)),(6,(1,2)),(7,(1,1)),(8,(3,2))],
-- array (0,8) [(0,(3,1)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(2,2)),
-- (5,(2,1)),(6,(1,2)),(7,(1,1)),(8,(3,2))],
-- array (0,8) [(0,(3,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(2,2)),
-- (5,(2,1)),(6,(1,2)),(7,(1,1)),(8,(3,1))],
-- array (0,8) [(0,(2,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(1,2)),(7,(1,1)),(8,(3,1))],
-- array (0,8) [(0,(1,2)),(1,(1,3)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(2,2)),(7,(1,1)),(8,(3,1))],
-- array (0,8) [(0,(1,3)),(1,(1,2)),(2,(2,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(2,2)),(7,(1,1)),(8,(3,1))],
-- array (0,8) [(0,(2,3)),(1,(1,2)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(2,2)),(7,(1,1)),(8,(3,1))],
-- array (0,8) [(0,(2,2)),(1,(1,2)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,1)),(6,(2,3)),(7,(1,1)),(8,(3,1))],
-- array (0,8) [(0,(2,1)),(1,(1,2)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,2)),(6,(2,3)),(7,(1,1)),(8,(3,1))],
-- array (0,8) [(0,(1,1)),(1,(1,2)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))],
-- array (0,8) [(0,(1,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(2,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))],
-- array (0,8) [(0,(2,2)),(1,(1,1)),(2,(1,3)),(3,(3,3)),(4,(3,2)),
-- (5,(1,2)),(6,(2,3)),(7,(2,1)),(8,(3,1))]],
-- 78)
buscaPM_8P :: [Tableros]
buscaPM_8P = buscaPM sucesores8P
esFinal8P
(Est [inicial8P])
-- (nSolucionesPM_8P) es el número de soluciones del 8 puzzle por
-- búsqueda primero el mejor. Por ejemplo,
-- nSolucionesPM_8P == 43
nSolucionesPM_8P :: Int
nSolucionesPM_8P = length ls
where (Est ls : _) = buscaPM sucesores8P
esFinal8P
(Est [inicial8P])