Additional information to the article

"Optimal Strategies for Static Black-Peg AB Game With
Two and Three Pegs"
(Author: Gerold Jäger, Frank Drewes) 

Correctness test of strategies for small number of colors c.

This directory contains two issues:

1. Strategies of the article:

	 The directory "strategies" contains all optimal strategies.
   One strategy is saved in a file with name 
     "ap_c_q".
	 where 
	 - "p" stands for the number of pegs of the problem,
	 - "c" stands for the number of colors of the problem,
	 - "q" stands for the number of main questions of the strategy.
   Then q rows follow, where each row contains one 
	 main question. However, the numbering begins with 
	 "0" and not with "1".

2. Source code:

   The source code consists of one file "abgame.cc".
	 It should be compiled with the compiler "g++" receiving
	 the executable "a.out".

	 "a.out -v0 -p2 -c3 -q6 strategy_file"

	 Checks whether a strategy of the file "strategy_file" is feasible. 
	 (Here the strategy has 2 pegs, 3 colors and 6 
	 main questions. Then the strategy file MUST 
	 correspond to this case. However, the program can 
	 also read only the first lines of the strategy 
	 file. I.e., if the strategy contains 6 main 
	 questions, then
	 "a.out -v0 -p2 -c3 -q5 strategy_file" checks only
	 the first 5 of the 6 main questions of the file.)
	 If the strategy is feasible, then the 
	 output is "optstrat=1".
	 If the strategy is not feasible, then 
	 the output is "optstrat=0".
	 If this is the case, the program additionally 
	 outputs a group of possible secrets which 
	 receive the same combination of answers.
	 Also the combination of answers is listed.
	 Finally, it is listed which colors and which
	 pegs can be determined with this infeasible strategy.



