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 Moves TurnNext stateCurrent state computer 1- 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. L t (s)- the function that cycles the elements in s to the left t positions. Complexity: memory-less and with O(2 n * 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: 2 n memory and O(2 n ) 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?

End dateStart dateTitleTask ID 10/3/111/3/11ADD presentation1 20/4/1110/3/11System prototype2 30/4/1120/4/11GUI3 30/5/1130/4/11Testing4 15/6/1130/5/11Project presentation 5 25/6/1115/6/11User manual6