PROBLEMA DE LAS 4 REINAS

La variable Xi representa a la fila en la que esta la

reina de la columna i.
Xi = [1,2,3,4] representa el dominio para la reina de
la columna i, es decir, la reina i puede estar en la fila
1, 2, 3 o 4.
R(Xi , Xj ) representa a la restriccion de que no puedan
atacarse las reinas de la columna i y la j (que no esten
en la misma fila ni la misma diagonal).
La asignaci
on X1 =1 es
ARCO-CONSISTENTE ?
Paso 0
X1 = [1] X2 = [1,2,3,4] X3 = [1,2,3,4] X4 = [1,2,3,4]
PILA: R(X1 , X2 ), R(X2 , X1 ), R(X1 , X3 ), R(X3 , X1 ),
R(X1 , X4 ), R(X4 , X1 )
Paso 1
Restriccion R(X1 , X2 ) X1 =[1],X2 =[1,2,3,4] OK
PILA: R(X2 , X1 ), R(X1 , X3 ), R(X3 , X1 ), R(X1 , X4 ),
R(X4 , X1 )
Paso 2
Restriccion R(X2 , X1 ) X2 =[1,2,3,4] X1 =[1] FAIL X2 =[3,4]
X1 =[1] OK
PILA: R(X1 , X2 ), R(X3 , X2 ), R(X4 , X2 ), R(X1 , X3 ),
R(X3 , X1 ), R(X1 , X4 ), R(X4 , X1 )
Paso 3
1

 Restriccion R(X1 , X2 ) X1 =[1] X2 =[3,4] OK

PILA: R(X3 , X2 ), R(X4 , X2 ), R(X1 , X3 ), R(X3 , X1 ),
R(X1 , X4 ), R(X4 , X1 )
Paso 4
Restriccion R(X3 , X2 ) X3 =[1,2,3,4] X2 =[3,4] FAIL
X3 =[1,2] X2 =[3,4] OK
PILA: R(X2 , X3 ), R(X1 , X3 ), R(X4 , X3 ), R(X4 , X2 ),
R(X1 , X3 ), R(X3 , X1 ), R(X1 , X4 ), R(X4 , X1 )
Paso 5
Restriccion R(X2 , X3 ) X2 =[3,4] X3 =[1,2] OK
PILA: R(X1 , X3 ), R(X4 , X3 ), R(X4 , X2 ), R(X1 , X3 ),
R(X3 , X1 ), R(X1 , X4 ), R(X4 , X1 )
Paso 6
Restriccion R(X1 , X3 ) X1 =[1] X3 =[1,2] OK
PILA: R(X4 , X3 ), R(X4 , X2 ), R(X1 , X3 ), R(X3 , X1 ),
R(X1 , X4 ), R(X4 , X1 )
Paso 7
Restriccion R(X4 , X3 ) X4 =[ 1,2,3,4] X3 =[1,2] FAIL
X4 =[3,4] X3 =[1,2]
PILA: R(X1 , X4 ), R(X2 , X4 ), R(X3 , X4 ), R(X4 , X2 ),
R(X1 , X3 ), R(X3 , X1 ), R(X1 , X4 ), R(X4 , X1 )
Paso 8
Restriccion R(X1 , X4 ) X1 =[1] X4 =[ 3,4] OK
PILA: R(X2 , X4 ), R(X3 , X4 ), R(X4 , X2 ), R(X1 , X3 ),
R(X3 , X1 ), R(X1 , X4 ), R(X4 , X1 )
Paso 9
2

 Restriccion R(X2 , X4 ) X2 =[3,4] X4 =[ 3,4] OK

PILA: R(X3 , X4 ), R(X4 , X2 ), R(X1 , X3 ), R(X3 , X1 ),
R(X1 , X4 ), R(X4 , X1 )
Paso 10
Restriccion R(X3 , X4 ) X3 =[1,2] X4 =[ 3,4] OK
PILA: R(X4 , X2 ), R(X1 , X3 ), R(X3 , X1 ), R(X1 , X4 ),
R(X4 , X1 )
Paso 11
Restriccion R(X4 , X2 ) X4 =[ 3,4] X2 =[3,4] OK
PILA: R(X1 , X3 ), R(X3 , X1 ), R(X1 , X4 ), R(X4 , X1 )
Paso 12
Restriccion R(X1 , X3 ) X1 =[1] X3 =[1,2] OK
PILA: R(X3 , X1 ), R(X1 , X4 ), R(X4 , X1 )
Paso 13
Restriccion R(X3 , X1 ) X3 =[ 1,2] X1 =[1] FAIL X3 =[2]
X1 =[1]
PILA: R(X1 , X3 ), R(X2 , X3 ), R(X4 , X3 ), R(X1 , X4 ),
R(X4 , X1 )
Paso 14
Restriccion R(X1 , X3 ) X1 =[1] X3 =[2] OK
PILA: R(X2 , X3 ), R(X4 , X3 ), R(X1 , X4 ), R(X4 , X1 )
Paso 15
Restriccion R(X2 , X3 ) X2 =[3,4] X3 =[2] FAIL X2 =[4]
X3 =[2] OK
PILA: R(X4 , X2 ), R(X1 , X2 ), R(X3 , X2 ), R(X4 , X3 ),
R(X1 , X4 ), R(X4 , X1 )
3

Paso 16
Restriccion R(X4 , X2 ) X4 =[3,4] X2 =[4] FAIL X4 =[3]
X2 =[4] OK
PILA: R(X3 , X4 ), R(X1 , X4 ), R(X2 , X4 ), R(X1 , X2 ),
R(X3 , X2 ), R(X4 , X3 ), R(X1 , X4 ), R(X4 , X1 )
Paso 17
Restriccion R(X3 , X4 ) X3 =[2] X4 =[3] FAIL X3 =[]
VACIO X4 =[3] DOMINIO VACIO X3 ,IMPOSIBLE
ARCO-CONSISTENTE
PILA: R(X1 , X4 ), R(X2 , X4 ), R(X1 , X2 ), R(X3 , X2 ),
R(X4 , X3 ), R(X1 , X4 ), R(X4 , X1 )
X1 =[1]
En 17 pasos se determina que la ASIGNACION
es erronea
El algoritmo AC3 devuelve los dominios X2 =[4],X3 =[],X4 =[3]
(X3 es Vaco )