gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/contribs/qecode/configure.ac

@@ -0,0 +1,23 @@
+dnl
+dnl Author:
+dnl   Jeremie Vautard
+dnl
+dnl Copyright:
+dnl   Universit� d'Orleans, 2005
+dnl
+dnl Largely inspired from the map configure.ac file by Gr�goire Dooms
+
+
+AC_REVISION([$Revision$])
+AC_PREREQ(2.53)
+AC_INIT(QECODE, 1.2, jeremie.vautard@univ-orleans.fr)
+AC_CONFIG_SRCDIR(qecode.hh)
+
+dnl the names of the generated dlls
+AC_SUBST(QECODE,     "qecode")
+
+../../config.status --file Makefile.in:Makefile.in.in
+
+AC_CONFIG_COMMANDS([Makefile.in]) 
+AC_CONFIG_FILES([Makefile])
+AC_OUTPUT

data/ext/gecode-2.2.0/contribs/qecode/examples/COMPILING

@@ -0,0 +1,13 @@
+To compile the examples, you must add the qecode folder and the gecode folder (i.e. .. and ../../.. from this examples folder) to your include and library paths. These examples have to been linked against the gecodeint, gecodekernel, gecodeminimodel, gecodesupport, and gecodeqecode libraries. If you built the dynamic version of the gecode/qecode libraries, you will also have to add these folders to the dynamic libraries search path.
+
+Example (with dynamic libs) : 
+  For Linux, using gcc :
+    $ g++ stress_test.cpp -I.. -I../../.. -L.. -L../../.. -lgecodeqecode -lgecodeminimodel -lgecodeint -lgecodekernel -lgecodesupport -o stress_test
+    $ export LD_LIBRARY_PATH="..:../../.." # only if using shared libraries
+    $ ./stress_test
+
+  For MacOS, using gcc : 
+    $ g++ stress_test.cpp -I.. -I../../.. -L.. -L../../.. -lgecodeqecode -lgecodeminimodel -lgecodesearch -lgecodeint -lgecodekernel -lgecodesupport -o stress_test
+    $ export DYLD_LIBRARY_PATH="..:../../.." # only if using shared libraries
+    $ ./stress_test
+

data/ext/gecode-2.2.0/contribs/qecode/examples/MatrixGame.cpp

@@ -0,0 +1,140 @@
+/****   , [ MatrixGame.cpp ], 
+Copyright (c) 2007 Universite d'Orleans - Arnaud Lallouet 
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+ *************************************************************************/
+
+#include <cstdlib> /* pour srand, rand et RAND_MAX */
+#include <ctime> /* pour time */
+#include <math.h> /* pour pow */
+
+#include <iostream>
+
+#include "gecode/minimodel.hh"
+#include "gecode/int/element.hh"
+
+#include "qsolver.hh"
+#include "implicative.hh"
+
+#define UNIVERSAL true
+#define EXISTENTIAL false
+
+// The Matrix game consists in a square boolean matrix of size 2^depth. First player cuts it vertically in two parts and removes one half,
+// while secodn player do the same, but cutting the matrix horizontally. The game ends when there are only one cell left in the matrix. 
+// If this last cell has value 1, the first player wins. If it has value 0, the second player wins. 
+
+// The present model of this game is pure QBF, that QeCode can handle (though not as fast as QBF solvers...)
+
+using namespace MiniModel;
+
+int main (int argc, char * const argv[]) {
+    
+    int depth = 5;  // Size of the matrix is 2^depth. Larger values may take long to solve...
+    int nbDecisionVar = 2*depth;
+    int nbScope = nbDecisionVar+1;
+    bool* qtScopes = new bool[nbScope];
+    for (int i=0;i<nbScope;i++) { 
+        qtScopes[i] = ((i%2) != 0);
+        cout << (((i%2) != 0)?"true":"false")<<endl;
+    }
+    int boardSize = (int)pow((double)2,(double)depth);
+    
+    std::srand(std::time(NULL));
+    
+    IntArgs board(boardSize*boardSize);
+    for (int i=0; i<boardSize; i++)
+        for (int j=0; j<boardSize; j++)
+            board[j*boardSize+i] = (int)( (double)rand()  /  ((double)RAND_MAX + 1) * 50 ) < 25 ? 0:1;
+    
+    IntArgs access(nbDecisionVar);
+    access[nbDecisionVar-1]=1;
+    access[nbDecisionVar-2]=boardSize;
+    for (int i=nbDecisionVar-3; i>=0; i--)
+        access[i]=access[i+2]*2;
+	
+    // debug
+    for (int i=0; i<boardSize; i++)
+    {
+        for (int j=0; j<boardSize; j++)
+            cout << board[j*boardSize+i] << " ";
+        cout << endl;
+	}
+    cout  << endl;
+    for (int i=0; i<nbDecisionVar; i++)
+        cout << access[i] << " ";
+    cout << endl;
+    // end debug
+    
+    int *scopesSize = new int[nbScope];
+    for (int i=0; i<nbScope-1; i++)
+        scopesSize[i]=1;
+    scopesSize[nbScope-1]=2;
+    
+    Implicative p(nbScope, qtScopes, scopesSize);
+    
+    // Defining the variable of the n first scopes ...
+    for (int i=0; i<nbDecisionVar; i++)
+    {
+        p.QIntVar(i, 0, 1);
+        IntVarArgs b(i+1);
+        for (int plop=0;plop<(i+1);plop++) 
+            b[plop] = p.var(plop);
+        branch(p.space(),b,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+        p.nextScope();
+    }
+	
+    // Declaring last scope variables ...
+    
+    p.QIntVar(nbDecisionVar, 0, 1);
+    p.QIntVar(nbDecisionVar+1, 0, boardSize*boardSize);
+    IntVarArgs b(nbDecisionVar+2);
+    for (int plop=0;plop<(nbDecisionVar+2);plop++) 
+        b[plop] = p.var(plop);
+    branch(p.space(),b,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+    p.nextScope();
+    // Body
+    
+    post(p.space(), p.var(nbDecisionVar) == 1);
+    
+    IntVarArgs X(nbDecisionVar);
+    for (int i=0; i<nbDecisionVar; i++)
+        X[i]=p.var(i);
+    
+    linear(p.space(), access, X, IRT_EQ, p.var(nbDecisionVar+1));
+    //  MiniModel::LinRel R(E, IRT_EQ, MiniModel::LinExpr(p.var(nbDecisionVar+1)));
+    element(p.space(), board, p.var(nbDecisionVar+1), p.var(nbDecisionVar));
+    
+    // When every variables and constraints have been declared, the makeStructure method
+    // must be called in order to lead the problem ready for solving.
+    p.makeStructure();
+    
+    // So, we build a quantified solver for our problem p, using the heuristic we just created.
+    QSolver solver(&p);
+    
+    unsigned long int nodes=0;
+    
+    // then we solve the problem. Nodes and Steps will contain the number of nodes encountered and
+    // of propagation steps achieved during the solving.
+    Strategy outcome = solver.solve(nodes);
+    
+    cout << "  outcome: " << ( outcome.isFalse()? "FALSE" : "TRUE") << endl;
+    cout << "  nodes visited: " << nodes << endl;
+    
+}

data/ext/gecode-2.2.0/contribs/qecode/examples/NimFibo.cpp

@@ -0,0 +1,73 @@
+/****   , [ NimFibo.cpp ], 
+Copyright (c) 2007 Universite d'Orleans - Jeremie Vautard 
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+ *************************************************************************/
+
+#include "qsolver.hh"
+#include "implicative.hh"
+
+///////////////////////////////////////////////////////////////////////////////////////////
+// This is a model of the nim-fibonacci game. We have a N matches set. First player may  //
+// take between 1 and N-1 matches. Then, each player may take at most twice the number of//
+// matches taken by the last player. Take the last match to win !                        //
+///////////////////////////////////////////////////////////////////////////////////////////
+
+int main() {
+    for (int N = 10; N<=22;N++)  // Initial number of matches
+    {
+    int* scopeSize = new int[N+2];
+    bool* qtScope = new bool[N+2];
+    for (int i=0;i<N+2;i++) {
+        qtScope[i] = ( i%2 != 0);
+        scopeSize[i] = 2;
+    }
+    Implicative p(N+2,qtScope,scopeSize);
+    
+    p.QIntVar(0,1,N-1);
+    p.QIntVar(1,0,N);
+    post(p.space(),p.var(0) == p.var(1));
+    IntVarArgs b(2); b[0] = p.var(0) ; b[1] = p.var(1);
+    branch(p.space(),b,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    p.nextScope();
+    
+    for (int i=1;i<N+2;i++) {
+        p.QIntVar(2*i , 1, N-1);
+        p.QIntVar(2*i + 1, 0, N);
+        post(p.space(), p.var(2*i) <= 2*p.var(2*(i-1)));
+        post(p.space(), p.var(2*i + 1) == p.var(2*i) + p.var(2*i - 1));
+        IntVarArgs bb(2*i + 2);
+        for (int plop = 0;plop < (2*i + 2);plop++)
+            bb[plop] = p.var(plop);
+        branch(p.space(),bb,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+        p.nextScope();
+    }
+    
+    p.makeStructure();
+    QSolver s(&p);
+    
+    unsigned long int nodes=0;
+    
+    Strategy outcome  = s.solve(nodes);
+    cout << "For " << N << " matches : "<<endl;
+    cout << "  outcome: " << ( outcome.isFalse() ? "FALSE" : "TRUE") << endl;
+    cout << "  nodes visited: " << nodes << endl;
+    }
+    return 0;
+}

data/ext/gecode-2.2.0/contribs/qecode/examples/connect-5-3-3-3.cpp

@@ -0,0 +1,842 @@
+// Quantified/alternating formulation of the Connect4 game
+// with a board of size 3x3 (widthxheight), a winning
+// line of length 3, analyzed up to 5 moves for the initial/existential player
+
+#include "gecode/minimodel.hh"
+#include "gecode/int/element.hh"
+
+#include "qsolver.hh"
+#include "implicative.hh"
+
+#define UNIVERSAL true
+#define EXISTENTIAL false
+
+#define WIDTH 3
+#define HEIGHT 3
+#define DEPTH 9
+
+#define VARS_PER_BOARD (WIDTH*HEIGHT)
+#define VARS_PER_STEP  (VARS_PER_BOARD + 1)
+
+#define CELL_VCODE(I,J,TIME) \
+	( (((I)-1)*WIDTH) + ((J)-1) + \
+	(((TIME)==0)? 0 : (((TIME))*(VARS_PER_STEP))))
+#define MOVE_VCODE(TIME) \
+	( VARS_PER_BOARD + ((TIME)-1)*VARS_PER_STEP )
+#define AUX_VCODE(N) ( (N) +  CELL_VCODE(HEIGHT,WIDTH,DEPTH) )
+
+#define B(I,J,TIME) p.var(CELL_VCODE(I,J,TIME))
+#define M(TIME)     p.var(MOVE_VCODE(TIME))
+#define AUX(N)      p.bvar(AUX_VCODE(N))
+
+using namespace Gecode;
+using namespace Gecode::MiniModel;
+
+int main () {
+            
+	int scopesSize[] = {19, 10, 10, 10, 10, 10, 10, 10, 18};
+    bool qts[] = {EXISTENTIAL,UNIVERSAL,EXISTENTIAL,UNIVERSAL,EXISTENTIAL,UNIVERSAL,EXISTENTIAL,UNIVERSAL,EXISTENTIAL};
+	Implicative p(9, qts, scopesSize);
+
+	p.QIntVar(0, 0, 2);  // B(1,1,0)
+	p.QIntVar(1, 0, 2);  // B(1,2,0)
+	p.QIntVar(2, 0, 2);  // B(1,3,0)
+	p.QIntVar(3, 0, 2);  // B(2,1,0)
+	p.QIntVar(4, 0, 2);  // B(2,2,0)
+	p.QIntVar(5, 0, 2);  // B(2,3,0)
+	p.QIntVar(6, 0, 2);  // B(3,1,0)
+	p.QIntVar(7, 0, 2);  // B(3,2,0)
+	p.QIntVar(8, 0, 2);  // B(3,3,0)
+	p.QIntVar(9, 1, 2);  // M(1)
+	p.QIntVar(10, 0, 2);  // B(1,1,1)
+	p.QIntVar(11, 0, 2);  // B(1,2,1)
+	p.QIntVar(12, 0, 2);  // B(1,3,1)
+	p.QIntVar(13, 0, 2);  // B(2,1,1)
+	p.QIntVar(14, 0, 2);  // B(2,2,1)
+	p.QIntVar(15, 0, 2);  // B(2,3,1)
+	p.QIntVar(16, 0, 2);  // B(3,1,1)
+	p.QIntVar(17, 0, 2);  // B(3,2,1)
+	p.QIntVar(18, 0, 2);  // B(3,3,1)
+
+	// The initial board is empty
+	post(p.space(), B(1,1,0)==0 );
+	post(p.space(), B(1,2,0)==0 );
+	post(p.space(), B(1,3,0)==0 );
+	post(p.space(), B(2,1,0)==0 );
+	post(p.space(), B(2,2,0)==0 );
+	post(p.space(), B(2,3,0)==0 );
+	post(p.space(), B(3,1,0)==0 );
+	post(p.space(), B(3,2,0)==0 );
+	post(p.space(), B(3,3,0)==0 );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 0->1
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,0)==0) || ~(M(1)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,0)==0) || ~(M(1)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,0)==0) || ~(M(1)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 0 to time 1
+	// The player who moves is "1"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,0)==1)) || ~(B(1,1,1)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,0)==1)) || ~(B(1,2,1)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,0)==1)) || ~(B(1,3,1)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,0)==1)) || ~(B(2,1,1)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,0)==1)) || ~(B(2,2,1)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,0)==1)) || ~(B(2,3,1)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,0)==1)) || ~(B(3,1,1)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,0)==1)) || ~(B(3,2,1)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,0)==1)) || ~(B(3,3,1)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,0)==2)) || ~(B(1,1,1)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,0)==2)) || ~(B(1,2,1)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,0)==2)) || ~(B(1,3,1)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,0)==2)) || ~(B(2,1,1)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,0)==2)) || ~(B(2,2,1)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,0)==2)) || ~(B(2,3,1)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,0)==2)) || ~(B(3,1,1)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,0)==2)) || ~(B(3,2,1)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,0)==2)) || ~(B(3,3,1)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,0)==0) && ~(B(1,1,0)==0)))) || ~(B(2,1,1)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,0)==0) && ~(B(1,2,0)==0)))) || ~(B(2,2,1)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,0)==0) && ~(B(1,3,0)==0)))) || ~(B(2,3,1)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,0)==0) && ~(B(2,1,0)==0)))) || ~(B(3,1,1)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,0)==0) && ~(B(2,2,0)==0)))) || ~(B(3,2,1)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,0)==0) && ~(B(2,3,0)==0)))) || ~(B(3,3,1)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "1" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,0)==0) && ~(B(1,1,1)!=0))) || ((~(B(1,1,1)==1) && ~(M(1)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,0)==0) && ~(B(1,2,1)!=0))) || ((~(B(1,2,1)==1) && ~(M(1)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,0)==0) && ~(B(1,3,1)!=0))) || ((~(B(1,3,1)==1) && ~(M(1)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,0)==0) && ~(B(2,1,1)!=0))) || ((~(B(2,1,1)==1) && ~(M(1)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,0)==0) && ~(B(2,2,1)!=0))) || ((~(B(2,2,1)==1) && ~(M(1)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,0)==0) && ~(B(2,3,1)!=0))) || ((~(B(2,3,1)==1) && ~(M(1)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,0)==0) && ~(B(3,1,1)!=0))) || ((~(B(3,1,1)==1) && ~(M(1)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,0)==0) && ~(B(3,2,1)!=0))) || ((~(B(3,2,1)==1) && ~(M(1)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,0)==0) && ~(B(3,3,1)!=0))) || ((~(B(3,3,1)==1) && ~(M(1)==3)))) ) );
+    
+    IntVarArgs b1(19);
+    for( int i=0;i<19;i++) {
+        b1[i] = p.var(i);
+    }
+    branch(p.space(),b1,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	p.nextScope();
+	p.QIntVar(19, 1, 3);  // M(2)
+	p.QIntVar(20, 0, 2);  // B(1,1,2)
+	p.QIntVar(21, 0, 2);  // B(1,2,2)
+	p.QIntVar(22, 0, 2);  // B(1,3,2)
+	p.QIntVar(23, 0, 2);  // B(2,1,2)
+	p.QIntVar(24, 0, 2);  // B(2,2,2)
+	p.QIntVar(25, 0, 2);  // B(2,3,2)
+	p.QIntVar(26, 0, 2);  // B(3,1,2)
+	p.QIntVar(27, 0, 2);  // B(3,2,2)
+	p.QIntVar(28, 0, 2);  // B(3,3,2)
+
+	// CGA (Cut-Game Axiom) between time 1 and time 2
+	// If player "1" won at time 1 then player "2" cannot play
+
+	// Non-winning condition for player 1 at time 1
+	post(p.space(), tt( (~(B(1,1,1)!=1) || ~(B(1,2,1)!=1) || ~(B(1,3,1)!=1)) ) );
+	post(p.space(), tt( (~(B(1,1,1)!=1) || ~(B(2,1,1)!=1) || ~(B(3,1,1)!=1)) ) );
+	post(p.space(), tt( (~(B(1,1,1)!=1) || ~(B(2,2,1)!=1) || ~(B(3,3,1)!=1)) ) );
+	post(p.space(), tt( (~(B(3,1,1)!=1) || ~(B(2,2,1)!=1) || ~(B(1,3,1)!=1)) ) );
+	post(p.space(), tt( (~(B(1,2,1)!=1) || ~(B(2,2,1)!=1) || ~(B(3,2,1)!=1)) ) );
+	post(p.space(), tt( (~(B(1,3,1)!=1) || ~(B(2,3,1)!=1) || ~(B(3,3,1)!=1)) ) );
+	post(p.space(), tt( (~(B(2,1,1)!=1) || ~(B(2,2,1)!=1) || ~(B(2,3,1)!=1)) ) );
+	post(p.space(), tt( (~(B(3,1,1)!=1) || ~(B(3,2,1)!=1) || ~(B(3,3,1)!=1)) ) );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 1->2
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,1)==0) || ~(M(2)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,1)==0) || ~(M(2)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,1)==0) || ~(M(2)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 1 to time 2
+	// The player who moves is "2"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,1)==1)) || ~(B(1,1,2)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,1)==1)) || ~(B(1,2,2)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,1)==1)) || ~(B(1,3,2)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,1)==1)) || ~(B(2,1,2)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,1)==1)) || ~(B(2,2,2)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,1)==1)) || ~(B(2,3,2)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,1)==1)) || ~(B(3,1,2)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,1)==1)) || ~(B(3,2,2)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,1)==1)) || ~(B(3,3,2)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,1)==2)) || ~(B(1,1,2)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,1)==2)) || ~(B(1,2,2)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,1)==2)) || ~(B(1,3,2)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,1)==2)) || ~(B(2,1,2)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,1)==2)) || ~(B(2,2,2)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,1)==2)) || ~(B(2,3,2)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,1)==2)) || ~(B(3,1,2)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,1)==2)) || ~(B(3,2,2)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,1)==2)) || ~(B(3,3,2)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,1)==0) && ~(B(1,1,1)==0)))) || ~(B(2,1,2)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,1)==0) && ~(B(1,2,1)==0)))) || ~(B(2,2,2)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,1)==0) && ~(B(1,3,1)==0)))) || ~(B(2,3,2)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,1)==0) && ~(B(2,1,1)==0)))) || ~(B(3,1,2)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,1)==0) && ~(B(2,2,1)==0)))) || ~(B(3,2,2)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,1)==0) && ~(B(2,3,1)==0)))) || ~(B(3,3,2)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "2" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,1)==0) && ~(B(1,1,2)!=0))) || ((~(B(1,1,2)==2) && ~(M(2)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,1)==0) && ~(B(1,2,2)!=0))) || ((~(B(1,2,2)==2) && ~(M(2)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,1)==0) && ~(B(1,3,2)!=0))) || ((~(B(1,3,2)==2) && ~(M(2)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,1)==0) && ~(B(2,1,2)!=0))) || ((~(B(2,1,2)==2) && ~(M(2)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,1)==0) && ~(B(2,2,2)!=0))) || ((~(B(2,2,2)==2) && ~(M(2)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,1)==0) && ~(B(2,3,2)!=0))) || ((~(B(2,3,2)==2) && ~(M(2)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,1)==0) && ~(B(3,1,2)!=0))) || ((~(B(3,1,2)==2) && ~(M(2)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,1)==0) && ~(B(3,2,2)!=0))) || ((~(B(3,2,2)==2) && ~(M(2)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,1)==0) && ~(B(3,3,2)!=0))) || ((~(B(3,3,2)==2) && ~(M(2)==3)))) ) );
+
+    IntVarArgs b2(29);
+    for( int i=0;i<29;i++) {
+        b2[i] = p.var(i);
+    }
+    branch(p.space(),b2,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	p.nextScope();
+	p.QIntVar(29, 1, 3);  // M(3)
+	p.QIntVar(30, 0, 2);  // B(1,1,3)
+	p.QIntVar(31, 0, 2);  // B(1,2,3)
+	p.QIntVar(32, 0, 2);  // B(1,3,3)
+	p.QIntVar(33, 0, 2);  // B(2,1,3)
+	p.QIntVar(34, 0, 2);  // B(2,2,3)
+	p.QIntVar(35, 0, 2);  // B(2,3,3)
+	p.QIntVar(36, 0, 2);  // B(3,1,3)
+	p.QIntVar(37, 0, 2);  // B(3,2,3)
+	p.QIntVar(38, 0, 2);  // B(3,3,3)
+
+	// CGA (Cut-Game Axiom) between time 2 and time 3
+	// If player "2" won at time 2 then player "1" cannot play
+
+	// Non-winning condition for player 2 at time 2
+	post(p.space(), tt( (~(B(1,1,2)!=2) || ~(B(1,2,2)!=2) || ~(B(1,3,2)!=2)) ) );
+	post(p.space(), tt( (~(B(1,1,2)!=2) || ~(B(2,1,2)!=2) || ~(B(3,1,2)!=2)) ) );
+	post(p.space(), tt( (~(B(1,1,2)!=2) || ~(B(2,2,2)!=2) || ~(B(3,3,2)!=2)) ) );
+	post(p.space(), tt( (~(B(3,1,2)!=2) || ~(B(2,2,2)!=2) || ~(B(1,3,2)!=2)) ) );
+	post(p.space(), tt( (~(B(1,2,2)!=2) || ~(B(2,2,2)!=2) || ~(B(3,2,2)!=2)) ) );
+	post(p.space(), tt( (~(B(1,3,2)!=2) || ~(B(2,3,2)!=2) || ~(B(3,3,2)!=2)) ) );
+	post(p.space(), tt( (~(B(2,1,2)!=2) || ~(B(2,2,2)!=2) || ~(B(2,3,2)!=2)) ) );
+	post(p.space(), tt( (~(B(3,1,2)!=2) || ~(B(3,2,2)!=2) || ~(B(3,3,2)!=2)) ) );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 2->3
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,2)==0) || ~(M(3)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,2)==0) || ~(M(3)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,2)==0) || ~(M(3)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 2 to time 3
+	// The player who moves is "1"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,2)==1)) || ~(B(1,1,3)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,2)==1)) || ~(B(1,2,3)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,2)==1)) || ~(B(1,3,3)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,2)==1)) || ~(B(2,1,3)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,2)==1)) || ~(B(2,2,3)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,2)==1)) || ~(B(2,3,3)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,2)==1)) || ~(B(3,1,3)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,2)==1)) || ~(B(3,2,3)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,2)==1)) || ~(B(3,3,3)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,2)==2)) || ~(B(1,1,3)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,2)==2)) || ~(B(1,2,3)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,2)==2)) || ~(B(1,3,3)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,2)==2)) || ~(B(2,1,3)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,2)==2)) || ~(B(2,2,3)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,2)==2)) || ~(B(2,3,3)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,2)==2)) || ~(B(3,1,3)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,2)==2)) || ~(B(3,2,3)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,2)==2)) || ~(B(3,3,3)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,2)==0) && ~(B(1,1,2)==0)))) || ~(B(2,1,3)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,2)==0) && ~(B(1,2,2)==0)))) || ~(B(2,2,3)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,2)==0) && ~(B(1,3,2)==0)))) || ~(B(2,3,3)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,2)==0) && ~(B(2,1,2)==0)))) || ~(B(3,1,3)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,2)==0) && ~(B(2,2,2)==0)))) || ~(B(3,2,3)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,2)==0) && ~(B(2,3,2)==0)))) || ~(B(3,3,3)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "1" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,2)==0) && ~(B(1,1,3)!=0))) || ((~(B(1,1,3)==1) && ~(M(3)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,2)==0) && ~(B(1,2,3)!=0))) || ((~(B(1,2,3)==1) && ~(M(3)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,2)==0) && ~(B(1,3,3)!=0))) || ((~(B(1,3,3)==1) && ~(M(3)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,2)==0) && ~(B(2,1,3)!=0))) || ((~(B(2,1,3)==1) && ~(M(3)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,2)==0) && ~(B(2,2,3)!=0))) || ((~(B(2,2,3)==1) && ~(M(3)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,2)==0) && ~(B(2,3,3)!=0))) || ((~(B(2,3,3)==1) && ~(M(3)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,2)==0) && ~(B(3,1,3)!=0))) || ((~(B(3,1,3)==1) && ~(M(3)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,2)==0) && ~(B(3,2,3)!=0))) || ((~(B(3,2,3)==1) && ~(M(3)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,2)==0) && ~(B(3,3,3)!=0))) || ((~(B(3,3,3)==1) && ~(M(3)==3)))) ) );
+
+    IntVarArgs b3(39);
+    for( int i=0;i<39;i++) {
+        b3[i] = p.var(i);
+    }
+    branch(p.space(),b3,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	p.nextScope();
+	p.QIntVar(39, 1, 3);  // M(4)
+	p.QIntVar(40, 0, 2);  // B(1,1,4)
+	p.QIntVar(41, 0, 2);  // B(1,2,4)
+	p.QIntVar(42, 0, 2);  // B(1,3,4)
+	p.QIntVar(43, 0, 2);  // B(2,1,4)
+	p.QIntVar(44, 0, 2);  // B(2,2,4)
+	p.QIntVar(45, 0, 2);  // B(2,3,4)
+	p.QIntVar(46, 0, 2);  // B(3,1,4)
+	p.QIntVar(47, 0, 2);  // B(3,2,4)
+	p.QIntVar(48, 0, 2);  // B(3,3,4)
+
+	// CGA (Cut-Game Axiom) between time 3 and time 4
+	// If player "1" won at time 3 then player "2" cannot play
+
+	// Non-winning condition for player 1 at time 3
+	post(p.space(), tt( (~(B(1,1,3)!=1) || ~(B(1,2,3)!=1) || ~(B(1,3,3)!=1)) ) );
+	post(p.space(), tt( (~(B(1,1,3)!=1) || ~(B(2,1,3)!=1) || ~(B(3,1,3)!=1)) ) );
+	post(p.space(), tt( (~(B(1,1,3)!=1) || ~(B(2,2,3)!=1) || ~(B(3,3,3)!=1)) ) );
+	post(p.space(), tt( (~(B(3,1,3)!=1) || ~(B(2,2,3)!=1) || ~(B(1,3,3)!=1)) ) );
+	post(p.space(), tt( (~(B(1,2,3)!=1) || ~(B(2,2,3)!=1) || ~(B(3,2,3)!=1)) ) );
+	post(p.space(), tt( (~(B(1,3,3)!=1) || ~(B(2,3,3)!=1) || ~(B(3,3,3)!=1)) ) );
+	post(p.space(), tt( (~(B(2,1,3)!=1) || ~(B(2,2,3)!=1) || ~(B(2,3,3)!=1)) ) );
+	post(p.space(), tt( (~(B(3,1,3)!=1) || ~(B(3,2,3)!=1) || ~(B(3,3,3)!=1)) ) );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 3->4
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,3)==0) || ~(M(4)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,3)==0) || ~(M(4)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,3)==0) || ~(M(4)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 3 to time 4
+	// The player who moves is "2"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,3)==1)) || ~(B(1,1,4)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,3)==1)) || ~(B(1,2,4)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,3)==1)) || ~(B(1,3,4)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,3)==1)) || ~(B(2,1,4)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,3)==1)) || ~(B(2,2,4)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,3)==1)) || ~(B(2,3,4)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,3)==1)) || ~(B(3,1,4)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,3)==1)) || ~(B(3,2,4)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,3)==1)) || ~(B(3,3,4)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,3)==2)) || ~(B(1,1,4)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,3)==2)) || ~(B(1,2,4)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,3)==2)) || ~(B(1,3,4)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,3)==2)) || ~(B(2,1,4)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,3)==2)) || ~(B(2,2,4)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,3)==2)) || ~(B(2,3,4)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,3)==2)) || ~(B(3,1,4)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,3)==2)) || ~(B(3,2,4)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,3)==2)) || ~(B(3,3,4)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,3)==0) && ~(B(1,1,3)==0)))) || ~(B(2,1,4)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,3)==0) && ~(B(1,2,3)==0)))) || ~(B(2,2,4)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,3)==0) && ~(B(1,3,3)==0)))) || ~(B(2,3,4)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,3)==0) && ~(B(2,1,3)==0)))) || ~(B(3,1,4)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,3)==0) && ~(B(2,2,3)==0)))) || ~(B(3,2,4)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,3)==0) && ~(B(2,3,3)==0)))) || ~(B(3,3,4)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "2" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,3)==0) && ~(B(1,1,4)!=0))) || ((~(B(1,1,4)==2) && ~(M(4)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,3)==0) && ~(B(1,2,4)!=0))) || ((~(B(1,2,4)==2) && ~(M(4)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,3)==0) && ~(B(1,3,4)!=0))) || ((~(B(1,3,4)==2) && ~(M(4)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,3)==0) && ~(B(2,1,4)!=0))) || ((~(B(2,1,4)==2) && ~(M(4)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,3)==0) && ~(B(2,2,4)!=0))) || ((~(B(2,2,4)==2) && ~(M(4)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,3)==0) && ~(B(2,3,4)!=0))) || ((~(B(2,3,4)==2) && ~(M(4)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,3)==0) && ~(B(3,1,4)!=0))) || ((~(B(3,1,4)==2) && ~(M(4)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,3)==0) && ~(B(3,2,4)!=0))) || ((~(B(3,2,4)==2) && ~(M(4)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,3)==0) && ~(B(3,3,4)!=0))) || ((~(B(3,3,4)==2) && ~(M(4)==3)))) ) );
+
+    IntVarArgs b4(49);
+    for( int i=0;i<49;i++) {
+        b4[i] = p.var(i);
+    }
+    branch(p.space(),b4,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	p.nextScope();
+	p.QIntVar(49, 1, 3);  // M(5)
+	p.QIntVar(50, 0, 2);  // B(1,1,5)
+	p.QIntVar(51, 0, 2);  // B(1,2,5)
+	p.QIntVar(52, 0, 2);  // B(1,3,5)
+	p.QIntVar(53, 0, 2);  // B(2,1,5)
+	p.QIntVar(54, 0, 2);  // B(2,2,5)
+	p.QIntVar(55, 0, 2);  // B(2,3,5)
+	p.QIntVar(56, 0, 2);  // B(3,1,5)
+	p.QIntVar(57, 0, 2);  // B(3,2,5)
+	p.QIntVar(58, 0, 2);  // B(3,3,5)
+
+	// CGA (Cut-Game Axiom) between time 4 and time 5
+	// If player "2" won at time 4 then player "1" cannot play
+
+	// Non-winning condition for player 2 at time 4
+	post(p.space(), tt( (~(B(1,1,4)!=2) || ~(B(1,2,4)!=2) || ~(B(1,3,4)!=2)) ) );
+	post(p.space(), tt( (~(B(1,1,4)!=2) || ~(B(2,1,4)!=2) || ~(B(3,1,4)!=2)) ) );
+	post(p.space(), tt( (~(B(1,1,4)!=2) || ~(B(2,2,4)!=2) || ~(B(3,3,4)!=2)) ) );
+	post(p.space(), tt( (~(B(3,1,4)!=2) || ~(B(2,2,4)!=2) || ~(B(1,3,4)!=2)) ) );
+	post(p.space(), tt( (~(B(1,2,4)!=2) || ~(B(2,2,4)!=2) || ~(B(3,2,4)!=2)) ) );
+	post(p.space(), tt( (~(B(1,3,4)!=2) || ~(B(2,3,4)!=2) || ~(B(3,3,4)!=2)) ) );
+	post(p.space(), tt( (~(B(2,1,4)!=2) || ~(B(2,2,4)!=2) || ~(B(2,3,4)!=2)) ) );
+	post(p.space(), tt( (~(B(3,1,4)!=2) || ~(B(3,2,4)!=2) || ~(B(3,3,4)!=2)) ) );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 4->5
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,4)==0) || ~(M(5)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,4)==0) || ~(M(5)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,4)==0) || ~(M(5)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 4 to time 5
+	// The player who moves is "1"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,4)==1)) || ~(B(1,1,5)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,4)==1)) || ~(B(1,2,5)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,4)==1)) || ~(B(1,3,5)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,4)==1)) || ~(B(2,1,5)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,4)==1)) || ~(B(2,2,5)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,4)==1)) || ~(B(2,3,5)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,4)==1)) || ~(B(3,1,5)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,4)==1)) || ~(B(3,2,5)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,4)==1)) || ~(B(3,3,5)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,4)==2)) || ~(B(1,1,5)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,4)==2)) || ~(B(1,2,5)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,4)==2)) || ~(B(1,3,5)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,4)==2)) || ~(B(2,1,5)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,4)==2)) || ~(B(2,2,5)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,4)==2)) || ~(B(2,3,5)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,4)==2)) || ~(B(3,1,5)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,4)==2)) || ~(B(3,2,5)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,4)==2)) || ~(B(3,3,5)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,4)==0) && ~(B(1,1,4)==0)))) || ~(B(2,1,5)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,4)==0) && ~(B(1,2,4)==0)))) || ~(B(2,2,5)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,4)==0) && ~(B(1,3,4)==0)))) || ~(B(2,3,5)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,4)==0) && ~(B(2,1,4)==0)))) || ~(B(3,1,5)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,4)==0) && ~(B(2,2,4)==0)))) || ~(B(3,2,5)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,4)==0) && ~(B(2,3,4)==0)))) || ~(B(3,3,5)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "1" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,4)==0) && ~(B(1,1,5)!=0))) || ((~(B(1,1,5)==1) && ~(M(5)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,4)==0) && ~(B(1,2,5)!=0))) || ((~(B(1,2,5)==1) && ~(M(5)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,4)==0) && ~(B(1,3,5)!=0))) || ((~(B(1,3,5)==1) && ~(M(5)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,4)==0) && ~(B(2,1,5)!=0))) || ((~(B(2,1,5)==1) && ~(M(5)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,4)==0) && ~(B(2,2,5)!=0))) || ((~(B(2,2,5)==1) && ~(M(5)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,4)==0) && ~(B(2,3,5)!=0))) || ((~(B(2,3,5)==1) && ~(M(5)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,4)==0) && ~(B(3,1,5)!=0))) || ((~(B(3,1,5)==1) && ~(M(5)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,4)==0) && ~(B(3,2,5)!=0))) || ((~(B(3,2,5)==1) && ~(M(5)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,4)==0) && ~(B(3,3,5)!=0))) || ((~(B(3,3,5)==1) && ~(M(5)==3)))) ) );
+
+    IntVarArgs b5(59);
+    for( int i=0;i<59;i++) {
+        b5[i] = p.var(i);
+    }
+    branch(p.space(),b5,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	p.nextScope();
+	p.QIntVar(59, 1, 3);  // M(6)
+	p.QIntVar(60, 0, 2);  // B(1,1,6)
+	p.QIntVar(61, 0, 2);  // B(1,2,6)
+	p.QIntVar(62, 0, 2);  // B(1,3,6)
+	p.QIntVar(63, 0, 2);  // B(2,1,6)
+	p.QIntVar(64, 0, 2);  // B(2,2,6)
+	p.QIntVar(65, 0, 2);  // B(2,3,6)
+	p.QIntVar(66, 0, 2);  // B(3,1,6)
+	p.QIntVar(67, 0, 2);  // B(3,2,6)
+	p.QIntVar(68, 0, 2);  // B(3,3,6)
+
+	// CGA (Cut-Game Axiom) between time 5 and time 6
+	// If player "1" won at time 5 then player "2" cannot play
+
+	// Non-winning condition for player 1 at time 5
+	post(p.space(), tt( (~(B(1,1,5)!=1) || ~(B(1,2,5)!=1) || ~(B(1,3,5)!=1)) ) );
+	post(p.space(), tt( (~(B(1,1,5)!=1) || ~(B(2,1,5)!=1) || ~(B(3,1,5)!=1)) ) );
+	post(p.space(), tt( (~(B(1,1,5)!=1) || ~(B(2,2,5)!=1) || ~(B(3,3,5)!=1)) ) );
+	post(p.space(), tt( (~(B(3,1,5)!=1) || ~(B(2,2,5)!=1) || ~(B(1,3,5)!=1)) ) );
+	post(p.space(), tt( (~(B(1,2,5)!=1) || ~(B(2,2,5)!=1) || ~(B(3,2,5)!=1)) ) );
+	post(p.space(), tt( (~(B(1,3,5)!=1) || ~(B(2,3,5)!=1) || ~(B(3,3,5)!=1)) ) );
+	post(p.space(), tt( (~(B(2,1,5)!=1) || ~(B(2,2,5)!=1) || ~(B(2,3,5)!=1)) ) );
+	post(p.space(), tt( (~(B(3,1,5)!=1) || ~(B(3,2,5)!=1) || ~(B(3,3,5)!=1)) ) );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 5->6
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,5)==0) || ~(M(6)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,5)==0) || ~(M(6)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,5)==0) || ~(M(6)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 5 to time 6
+	// The player who moves is "2"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,5)==1)) || ~(B(1,1,6)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,5)==1)) || ~(B(1,2,6)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,5)==1)) || ~(B(1,3,6)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,5)==1)) || ~(B(2,1,6)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,5)==1)) || ~(B(2,2,6)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,5)==1)) || ~(B(2,3,6)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,5)==1)) || ~(B(3,1,6)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,5)==1)) || ~(B(3,2,6)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,5)==1)) || ~(B(3,3,6)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,5)==2)) || ~(B(1,1,6)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,5)==2)) || ~(B(1,2,6)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,5)==2)) || ~(B(1,3,6)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,5)==2)) || ~(B(2,1,6)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,5)==2)) || ~(B(2,2,6)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,5)==2)) || ~(B(2,3,6)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,5)==2)) || ~(B(3,1,6)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,5)==2)) || ~(B(3,2,6)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,5)==2)) || ~(B(3,3,6)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,5)==0) && ~(B(1,1,5)==0)))) || ~(B(2,1,6)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,5)==0) && ~(B(1,2,5)==0)))) || ~(B(2,2,6)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,5)==0) && ~(B(1,3,5)==0)))) || ~(B(2,3,6)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,5)==0) && ~(B(2,1,5)==0)))) || ~(B(3,1,6)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,5)==0) && ~(B(2,2,5)==0)))) || ~(B(3,2,6)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,5)==0) && ~(B(2,3,5)==0)))) || ~(B(3,3,6)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "2" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,5)==0) && ~(B(1,1,6)!=0))) || ((~(B(1,1,6)==2) && ~(M(6)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,5)==0) && ~(B(1,2,6)!=0))) || ((~(B(1,2,6)==2) && ~(M(6)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,5)==0) && ~(B(1,3,6)!=0))) || ((~(B(1,3,6)==2) && ~(M(6)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,5)==0) && ~(B(2,1,6)!=0))) || ((~(B(2,1,6)==2) && ~(M(6)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,5)==0) && ~(B(2,2,6)!=0))) || ((~(B(2,2,6)==2) && ~(M(6)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,5)==0) && ~(B(2,3,6)!=0))) || ((~(B(2,3,6)==2) && ~(M(6)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,5)==0) && ~(B(3,1,6)!=0))) || ((~(B(3,1,6)==2) && ~(M(6)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,5)==0) && ~(B(3,2,6)!=0))) || ((~(B(3,2,6)==2) && ~(M(6)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,5)==0) && ~(B(3,3,6)!=0))) || ((~(B(3,3,6)==2) && ~(M(6)==3)))) ) );
+
+    IntVarArgs b6(69);
+    for( int i=0;i<69;i++) {
+        b6[i] = p.var(i);
+    }
+    branch(p.space(),b6,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	p.nextScope();
+	p.QIntVar(69, 1, 3);  // M(7)
+	p.QIntVar(70, 0, 2);  // B(1,1,7)
+	p.QIntVar(71, 0, 2);  // B(1,2,7)
+	p.QIntVar(72, 0, 2);  // B(1,3,7)
+	p.QIntVar(73, 0, 2);  // B(2,1,7)
+	p.QIntVar(74, 0, 2);  // B(2,2,7)
+	p.QIntVar(75, 0, 2);  // B(2,3,7)
+	p.QIntVar(76, 0, 2);  // B(3,1,7)
+	p.QIntVar(77, 0, 2);  // B(3,2,7)
+	p.QIntVar(78, 0, 2);  // B(3,3,7)
+
+	// CGA (Cut-Game Axiom) between time 6 and time 7
+	// If player "2" won at time 6 then player "1" cannot play
+
+	// Non-winning condition for player 2 at time 6
+	post(p.space(), tt( (~(B(1,1,6)!=2) || ~(B(1,2,6)!=2) || ~(B(1,3,6)!=2)) ) );
+	post(p.space(), tt( (~(B(1,1,6)!=2) || ~(B(2,1,6)!=2) || ~(B(3,1,6)!=2)) ) );
+	post(p.space(), tt( (~(B(1,1,6)!=2) || ~(B(2,2,6)!=2) || ~(B(3,3,6)!=2)) ) );
+	post(p.space(), tt( (~(B(3,1,6)!=2) || ~(B(2,2,6)!=2) || ~(B(1,3,6)!=2)) ) );
+	post(p.space(), tt( (~(B(1,2,6)!=2) || ~(B(2,2,6)!=2) || ~(B(3,2,6)!=2)) ) );
+	post(p.space(), tt( (~(B(1,3,6)!=2) || ~(B(2,3,6)!=2) || ~(B(3,3,6)!=2)) ) );
+	post(p.space(), tt( (~(B(2,1,6)!=2) || ~(B(2,2,6)!=2) || ~(B(2,3,6)!=2)) ) );
+	post(p.space(), tt( (~(B(3,1,6)!=2) || ~(B(3,2,6)!=2) || ~(B(3,3,6)!=2)) ) );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 6->7
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,6)==0) || ~(M(7)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,6)==0) || ~(M(7)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,6)==0) || ~(M(7)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 6 to time 7
+	// The player who moves is "1"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,6)==1)) || ~(B(1,1,7)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,6)==1)) || ~(B(1,2,7)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,6)==1)) || ~(B(1,3,7)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,6)==1)) || ~(B(2,1,7)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,6)==1)) || ~(B(2,2,7)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,6)==1)) || ~(B(2,3,7)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,6)==1)) || ~(B(3,1,7)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,6)==1)) || ~(B(3,2,7)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,6)==1)) || ~(B(3,3,7)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,6)==2)) || ~(B(1,1,7)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,6)==2)) || ~(B(1,2,7)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,6)==2)) || ~(B(1,3,7)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,6)==2)) || ~(B(2,1,7)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,6)==2)) || ~(B(2,2,7)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,6)==2)) || ~(B(2,3,7)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,6)==2)) || ~(B(3,1,7)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,6)==2)) || ~(B(3,2,7)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,6)==2)) || ~(B(3,3,7)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,6)==0) && ~(B(1,1,6)==0)))) || ~(B(2,1,7)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,6)==0) && ~(B(1,2,6)==0)))) || ~(B(2,2,7)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,6)==0) && ~(B(1,3,6)==0)))) || ~(B(2,3,7)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,6)==0) && ~(B(2,1,6)==0)))) || ~(B(3,1,7)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,6)==0) && ~(B(2,2,6)==0)))) || ~(B(3,2,7)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,6)==0) && ~(B(2,3,6)==0)))) || ~(B(3,3,7)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "1" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,6)==0) && ~(B(1,1,7)!=0))) || ((~(B(1,1,7)==1) && ~(M(7)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,6)==0) && ~(B(1,2,7)!=0))) || ((~(B(1,2,7)==1) && ~(M(7)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,6)==0) && ~(B(1,3,7)!=0))) || ((~(B(1,3,7)==1) && ~(M(7)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,6)==0) && ~(B(2,1,7)!=0))) || ((~(B(2,1,7)==1) && ~(M(7)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,6)==0) && ~(B(2,2,7)!=0))) || ((~(B(2,2,7)==1) && ~(M(7)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,6)==0) && ~(B(2,3,7)!=0))) || ((~(B(2,3,7)==1) && ~(M(7)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,6)==0) && ~(B(3,1,7)!=0))) || ((~(B(3,1,7)==1) && ~(M(7)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,6)==0) && ~(B(3,2,7)!=0))) || ((~(B(3,2,7)==1) && ~(M(7)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,6)==0) && ~(B(3,3,7)!=0))) || ((~(B(3,3,7)==1) && ~(M(7)==3)))) ) );
+
+    IntVarArgs b7(79);
+    for( int i=0;i<79;i++) {
+        b7[i] = p.var(i);
+    }
+    branch(p.space(),b7,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	p.nextScope();
+	p.QIntVar(79, 1, 3);  // M(8)
+	p.QIntVar(80, 0, 2);  // B(1,1,8)
+	p.QIntVar(81, 0, 2);  // B(1,2,8)
+	p.QIntVar(82, 0, 2);  // B(1,3,8)
+	p.QIntVar(83, 0, 2);  // B(2,1,8)
+	p.QIntVar(84, 0, 2);  // B(2,2,8)
+	p.QIntVar(85, 0, 2);  // B(2,3,8)
+	p.QIntVar(86, 0, 2);  // B(3,1,8)
+	p.QIntVar(87, 0, 2);  // B(3,2,8)
+	p.QIntVar(88, 0, 2);  // B(3,3,8)
+
+	// CGA (Cut-Game Axiom) between time 7 and time 8
+	// If player "1" won at time 7 then player "2" cannot play
+
+	// Non-winning condition for player 1 at time 7
+	post(p.space(), tt( (~(B(1,1,7)!=1) || ~(B(1,2,7)!=1) || ~(B(1,3,7)!=1)) ) );
+	post(p.space(), tt( (~(B(1,1,7)!=1) || ~(B(2,1,7)!=1) || ~(B(3,1,7)!=1)) ) );
+	post(p.space(), tt( (~(B(1,1,7)!=1) || ~(B(2,2,7)!=1) || ~(B(3,3,7)!=1)) ) );
+	post(p.space(), tt( (~(B(3,1,7)!=1) || ~(B(2,2,7)!=1) || ~(B(1,3,7)!=1)) ) );
+	post(p.space(), tt( (~(B(1,2,7)!=1) || ~(B(2,2,7)!=1) || ~(B(3,2,7)!=1)) ) );
+	post(p.space(), tt( (~(B(1,3,7)!=1) || ~(B(2,3,7)!=1) || ~(B(3,3,7)!=1)) ) );
+	post(p.space(), tt( (~(B(2,1,7)!=1) || ~(B(2,2,7)!=1) || ~(B(2,3,7)!=1)) ) );
+	post(p.space(), tt( (~(B(3,1,7)!=1) || ~(B(3,2,7)!=1) || ~(B(3,3,7)!=1)) ) );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 7->8
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,7)==0) || ~(M(8)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,7)==0) || ~(M(8)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,7)==0) || ~(M(8)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 7 to time 8
+	// The player who moves is "2"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,7)==1)) || ~(B(1,1,8)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,7)==1)) || ~(B(1,2,8)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,7)==1)) || ~(B(1,3,8)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,7)==1)) || ~(B(2,1,8)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,7)==1)) || ~(B(2,2,8)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,7)==1)) || ~(B(2,3,8)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,7)==1)) || ~(B(3,1,8)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,7)==1)) || ~(B(3,2,8)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,7)==1)) || ~(B(3,3,8)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,7)==2)) || ~(B(1,1,8)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,7)==2)) || ~(B(1,2,8)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,7)==2)) || ~(B(1,3,8)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,7)==2)) || ~(B(2,1,8)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,7)==2)) || ~(B(2,2,8)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,7)==2)) || ~(B(2,3,8)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,7)==2)) || ~(B(3,1,8)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,7)==2)) || ~(B(3,2,8)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,7)==2)) || ~(B(3,3,8)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,7)==0) && ~(B(1,1,7)==0)))) || ~(B(2,1,8)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,7)==0) && ~(B(1,2,7)==0)))) || ~(B(2,2,8)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,7)==0) && ~(B(1,3,7)==0)))) || ~(B(2,3,8)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,7)==0) && ~(B(2,1,7)==0)))) || ~(B(3,1,8)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,7)==0) && ~(B(2,2,7)==0)))) || ~(B(3,2,8)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,7)==0) && ~(B(2,3,7)==0)))) || ~(B(3,3,8)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "2" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,7)==0) && ~(B(1,1,8)!=0))) || ((~(B(1,1,8)==2) && ~(M(8)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,7)==0) && ~(B(1,2,8)!=0))) || ((~(B(1,2,8)==2) && ~(M(8)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,7)==0) && ~(B(1,3,8)!=0))) || ((~(B(1,3,8)==2) && ~(M(8)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,7)==0) && ~(B(2,1,8)!=0))) || ((~(B(2,1,8)==2) && ~(M(8)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,7)==0) && ~(B(2,2,8)!=0))) || ((~(B(2,2,8)==2) && ~(M(8)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,7)==0) && ~(B(2,3,8)!=0))) || ((~(B(2,3,8)==2) && ~(M(8)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,7)==0) && ~(B(3,1,8)!=0))) || ((~(B(3,1,8)==2) && ~(M(8)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,7)==0) && ~(B(3,2,8)!=0))) || ((~(B(3,2,8)==2) && ~(M(8)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,7)==0) && ~(B(3,3,8)!=0))) || ((~(B(3,3,8)==2) && ~(M(8)==3)))) ) );
+
+    IntVarArgs b8(89);
+    for( int i=0;i<89;i++) {
+        b8[i] = p.var(i);
+    }
+    branch(p.space(),b8,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	p.nextScope();
+	p.QIntVar(89, 1, 3);  // M(9)
+	p.QIntVar(90, 0, 2);  // B(1,1,9)
+	p.QIntVar(91, 0, 2);  // B(1,2,9)
+	p.QIntVar(92, 0, 2);  // B(1,3,9)
+	p.QIntVar(93, 0, 2);  // B(2,1,9)
+	p.QIntVar(94, 0, 2);  // B(2,2,9)
+	p.QIntVar(95, 0, 2);  // B(2,3,9)
+	p.QIntVar(96, 0, 2);  // B(3,1,9)
+	p.QIntVar(97, 0, 2);  // B(3,2,9)
+	p.QIntVar(98, 0, 2);  // B(3,3,9)
+	p.QBoolVar(99); // AUX(1)
+	p.QBoolVar(100); // AUX(2)
+	p.QBoolVar(101); // AUX(3)
+	p.QBoolVar(102); // AUX(4)
+	p.QBoolVar(103); // AUX(5)
+	p.QBoolVar(104); // AUX(6)
+	p.QBoolVar(105); // AUX(7)
+	p.QBoolVar(106); // AUX(8)
+
+	// CGA (Cut-Game Axiom) between time 8 and time 9
+	// If player "2" won at time 8 then player "1" cannot play
+
+	// Non-winning condition for player 2 at time 8
+	post(p.space(), tt( (~(B(1,1,8)!=2) || ~(B(1,2,8)!=2) || ~(B(1,3,8)!=2)) ) );
+	post(p.space(), tt( (~(B(1,1,8)!=2) || ~(B(2,1,8)!=2) || ~(B(3,1,8)!=2)) ) );
+	post(p.space(), tt( (~(B(1,1,8)!=2) || ~(B(2,2,8)!=2) || ~(B(3,3,8)!=2)) ) );
+	post(p.space(), tt( (~(B(3,1,8)!=2) || ~(B(2,2,8)!=2) || ~(B(1,3,8)!=2)) ) );
+	post(p.space(), tt( (~(B(1,2,8)!=2) || ~(B(2,2,8)!=2) || ~(B(3,2,8)!=2)) ) );
+	post(p.space(), tt( (~(B(1,3,8)!=2) || ~(B(2,3,8)!=2) || ~(B(3,3,8)!=2)) ) );
+	post(p.space(), tt( (~(B(2,1,8)!=2) || ~(B(2,2,8)!=2) || ~(B(2,3,8)!=2)) ) );
+	post(p.space(), tt( (~(B(3,1,8)!=2) || ~(B(3,2,8)!=2) || ~(B(3,3,8)!=2)) ) );
+
+	// PA (Precondition Axiom) specifying legal moves at transition 8->9
+	// A move is valid only if the related colum is not full
+	post(p.space(), tt( (~(B(3,1,8)==0) || ~(M(9)!=1)) ) );
+	post(p.space(), tt( (~(B(3,2,8)==0) || ~(M(9)!=2)) ) );
+	post(p.space(), tt( (~(B(3,3,8)==0) || ~(M(9)!=3)) ) );
+
+	// SSA (Successor State Axiom) linking time 8 to time 9
+	// The player who moves is "1"
+
+	// If a cell is occupied by player 1, it stays so
+	post(p.space(), tt( (!(~(B(1,1,8)==1)) || ~(B(1,1,9)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,2,8)==1)) || ~(B(1,2,9)==1)) ) );
+	post(p.space(), tt( (!(~(B(1,3,8)==1)) || ~(B(1,3,9)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,1,8)==1)) || ~(B(2,1,9)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,2,8)==1)) || ~(B(2,2,9)==1)) ) );
+	post(p.space(), tt( (!(~(B(2,3,8)==1)) || ~(B(2,3,9)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,1,8)==1)) || ~(B(3,1,9)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,2,8)==1)) || ~(B(3,2,9)==1)) ) );
+	post(p.space(), tt( (!(~(B(3,3,8)==1)) || ~(B(3,3,9)==1)) ) );
+
+	// If a cell is occupied by player 2, it stays so
+	post(p.space(), tt( (!(~(B(1,1,8)==2)) || ~(B(1,1,9)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,2,8)==2)) || ~(B(1,2,9)==2)) ) );
+	post(p.space(), tt( (!(~(B(1,3,8)==2)) || ~(B(1,3,9)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,1,8)==2)) || ~(B(2,1,9)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,2,8)==2)) || ~(B(2,2,9)==2)) ) );
+	post(p.space(), tt( (!(~(B(2,3,8)==2)) || ~(B(2,3,9)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,1,8)==2)) || ~(B(3,1,9)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,2,8)==2)) || ~(B(3,2,9)==2)) ) );
+	post(p.space(), tt( (!(~(B(3,3,8)==2)) || ~(B(3,3,9)==2)) ) );
+
+	// A free cell on top of a free cell stays free
+	post(p.space(), tt( (!(((~(B(2,1,8)==0) && ~(B(1,1,8)==0)))) || ~(B(2,1,9)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,2,8)==0) && ~(B(1,2,8)==0)))) || ~(B(2,2,9)==0)) ) );
+	post(p.space(), tt( (!(((~(B(2,3,8)==0) && ~(B(1,3,8)==0)))) || ~(B(2,3,9)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,1,8)==0) && ~(B(2,1,8)==0)))) || ~(B(3,1,9)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,2,8)==0) && ~(B(2,2,8)==0)))) || ~(B(3,2,9)==0)) ) );
+	post(p.space(), tt( (!(((~(B(3,3,8)==0) && ~(B(2,3,8)==0)))) || ~(B(3,3,9)==0)) ) );
+
+	// A cell that changes value can only turn from "0" to "1" (moving player code)
+	// ..and at most one such switch can happen in the whole board
+	post(p.space(), tt( (!((~(B(1,1,8)==0) && ~(B(1,1,9)!=0))) || ((~(B(1,1,9)==1) && ~(M(9)==1)))) ) );
+	post(p.space(), tt( (!((~(B(1,2,8)==0) && ~(B(1,2,9)!=0))) || ((~(B(1,2,9)==1) && ~(M(9)==2)))) ) );
+	post(p.space(), tt( (!((~(B(1,3,8)==0) && ~(B(1,3,9)!=0))) || ((~(B(1,3,9)==1) && ~(M(9)==3)))) ) );
+	post(p.space(), tt( (!((~(B(2,1,8)==0) && ~(B(2,1,9)!=0))) || ((~(B(2,1,9)==1) && ~(M(9)==1)))) ) );
+	post(p.space(), tt( (!((~(B(2,2,8)==0) && ~(B(2,2,9)!=0))) || ((~(B(2,2,9)==1) && ~(M(9)==2)))) ) );
+	post(p.space(), tt( (!((~(B(2,3,8)==0) && ~(B(2,3,9)!=0))) || ((~(B(2,3,9)==1) && ~(M(9)==3)))) ) );
+	post(p.space(), tt( (!((~(B(3,1,8)==0) && ~(B(3,1,9)!=0))) || ((~(B(3,1,9)==1) && ~(M(9)==1)))) ) );
+	post(p.space(), tt( (!((~(B(3,2,8)==0) && ~(B(3,2,9)!=0))) || ((~(B(3,2,9)==1) && ~(M(9)==2)))) ) );
+	post(p.space(), tt( (!((~(B(3,3,8)==0) && ~(B(3,3,9)!=0))) || ((~(B(3,3,9)==1) && ~(M(9)==3)))) ) );
+
+	// Winning condition for player 1 at time 9
+	post(p.space(), tt( (!(BoolExpr(AUX(1))) || (~(B(1,1,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(1))) || (~(B(1,2,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(1))) || (~(B(1,3,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(2))) || (~(B(1,1,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(2))) || (~(B(2,1,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(2))) || (~(B(3,1,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(3))) || (~(B(1,1,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(3))) || (~(B(2,2,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(3))) || (~(B(3,3,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(4))) || (~(B(3,1,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(4))) || (~(B(2,2,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(4))) || (~(B(1,3,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(5))) || (~(B(1,2,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(5))) || (~(B(2,2,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(5))) || (~(B(3,2,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(6))) || (~(B(1,3,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(6))) || (~(B(2,3,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(6))) || (~(B(3,3,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(7))) || (~(B(2,1,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(7))) || (~(B(2,2,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(7))) || (~(B(2,3,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(8))) || (~(B(3,1,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(8))) || (~(B(3,2,9)==1))) ) );
+	post(p.space(), tt( (!(BoolExpr(AUX(8))) || (~(B(3,3,9)==1))) ) );
+	post(p.space(), tt( (BoolExpr(AUX(1)) || BoolExpr(AUX(2)) || BoolExpr(AUX(3)) || BoolExpr(AUX(4)) || BoolExpr(AUX(5)) || BoolExpr(AUX(6)) || BoolExpr(AUX(7)) || BoolExpr(AUX(8))) ) );
+
+    IntVarArgs b9(99);
+    for( int i=0;i<99;i++) {
+        b9[i] = p.var(i);
+    }
+    branch(p.space(),b9,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+    BoolVarArgs b10(8);
+    b10[0]=p.bvar(99);
+    b10[1]=p.bvar(100);
+    b10[2]=p.bvar(101);
+    b10[3]=p.bvar(102);
+    b10[4]=p.bvar(103);
+    b10[5]=p.bvar(104);
+    b10[6]=p.bvar(105);
+    b10[7]=p.bvar(106);
+    branch(p.space(),b10,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+	// Now we set-up the space, define the solver, and run it    
+	p.makeStructure();
+    
+    QSolver solver(&p);
+
+	unsigned long int nodes=0;
+
+	Strategy outcome = solver.solve(nodes);
+    cout<<nodes<<" nodes crossed."<<endl;
+
+	return 0;
+}