Jip J. Dekker
981be2067e
git-subtree-dir: software/gecode_on_replay git-subtree-split: 8051d92b9c89e49cccfbd1c201371580d7703ab4
80 lines
3.1 KiB
C++
80 lines
3.1 KiB
C++
/**** , [ 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_qcop.hh"
|
|
#include "QCOPPlus.hh"
|
|
#include <time.h>
|
|
|
|
///////////////////////////////////////////////////////////////////////////////////////////
|
|
// 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
|
|
{
|
|
clock_t start, finish;
|
|
start=clock();
|
|
|
|
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;
|
|
}
|
|
Qcop p(N+2,qtScope,scopeSize);
|
|
|
|
p.QIntVar(0,1,N-1);
|
|
p.QIntVar(1,0,N);
|
|
rel(*(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);
|
|
rel(*(p.space()), p.var(2*i) <= 2*p.var(2*(i-1)));
|
|
rel(*(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();
|
|
QCOP_solver s(&p);
|
|
|
|
unsigned long int nodes=0;
|
|
|
|
Strategy outcome = s.solve(nodes);
|
|
finish=clock();
|
|
cout << "For " << N << " matches : "<<endl;
|
|
cout << " outcome: " << ( outcome.isFalse() ? "FALSE" : "TRUE") << endl;
|
|
cout << " nodes visited: " << nodes << endl;
|
|
cout << "Time taken: " << (finish-start) << " microseconds."<<endl;
|
|
}
|
|
return 0;
|
|
}
|