• Our project main purpose is to develop a tool for a combinatorial game researcher.

• Given a version of combinatorial puzzle game

and few more parameters, our programming tool will run the game sequence and provide the results.

Game MovesCurrent stateNext stateTurn

000001000

010000100

001001010

010110100

101000011

000111000

110001101

011000110

001111010

110111101

111001111

011111110

111110111

101110011

100110001

100000001

0-computer1- player

Turn is chosen according to the right most bit of the state.

Running example with n=4 :

Running example – cont.

Engine:• Receive data file- reads input file from the

user.• Categorize data – put the given values to the

game parameters.• Send output- send the game definitions to the

game sequence.

Game Sequence:• Build game sequence - running the game with

the given definitions.• Output results- send the game results to

analyzer.Analyzer:• Analyze results – process results.• Show results- export results to Excel or

“mathematica”.

Game Definition Game Sequence

Game Algorithms

GUI Export

Analyzer

The software components are :• Graphical User Interface• Game Definition:

-Strategy -turn choosing rule-number of bits-bit arity -winning condition

• Engine: will simulate activating the game with given definitions.

• Game Sequence: run the game with the given definitions.

• Analyzer: prepare the report of the game.• Export: we can export the report into Excel

and “Mathematica”.

Additional libraries:• JUnit – for the Acceptance test Unit of the

System• The input files will be Java class and the user

will load it's location through the GUI.• The output file can be of type txt, Excel,

“Mathematica”.• The software runs on a single PC.

Basic Configuration Initial State Configuration

Winning Condition Configuration

Turn Choosing Rule Configuration

Strategy Configuration

Game playing Configuration

Game Playing

1 .Deterministic memory less strategy:

Definitions:• t- Denotes the round’s of the game. t belongs to natural

numbers.• s- Denotes the state of the game. ‘s’ is binary sequence.• Lt(s)- the function that cycles the elements in s to the left t

positions.• Complexity: memory-less and with O(2n* n) moves.

• For n natural number, define the sequence v0,v1,.. of dimensional binary vectors as follows. Let v0={0,….,0}, and for vm=(b1,….bn).

• Complexity: 2n memory and O(2n) moves.

2.Using de bruijn sequence strategy:

• How to compute the space complexity used while running any strategy?

• How can we load java class and run it?

Task IDTitleStart dateEnd date

1ADD presentation1/3/1110/3/11

2System prototype10/3/1120/4/11

3GUI20/4/1130/4/11

4Testing30/4/1130/5/11

5Project presentation

30/5/1115/6/11

6User manual15/6/1125/6/11