Awale.

Copyright (C) 2006 Alain Le Bot and Laurent Le Bot.
See the end for copying conditions.

Please send awale bug reports to alain.le-bot@ec-lyon.fr.

Version 1.6, 27 dec 2014
Add German to languages
Two minor bugs fixed in the graphical interface

Version 1.5, 2 jan 2012
Step by step distribution of seeds for a better visualisation of moves.

Version 1.4, 30 July 2009
The graphical interface can now display up to 15 seeds instead of 9.
All options are permanently saved in file .xawale.ini.
Several bugs have been fixed.


Version 1.3, 6 may 2008
The rules can now be configured in order to match with all other
standard rules, and in particular, the rules of the Oware Society.
Four parameters are introduced,
1 The option -e or --eat to specify the maximum number of holes that 
can be eaten.
2 The option -m or --noeatmore to specify that nothing is eaten when
trying to eat more than the maximum allowed.
3 The option -a or --noeatall to specify that nothing is eaten when
trying to eat all the opponent seeds although the move is allowed.
4 The option -k or --noattackall to specify that it is forbiden to
attack all the opponent seeds, excepted if this is the only possible
move.
These parameters can be configured via xawale in graphical mode or 
via awale -emak in console mode.
Permanent save of language in file .xawale.ini
Implementation of cyclic end game. 


Version 1.2, 31 august 2007
Level 1 has been reduced and level 0 is introduced for beginners.
Just played hole is highlighted with black circles.
Translation in English, French and Spanish.

Version 1.1, may 13 2007
It is now possible to load and save games in file.
Shortcuts Crtl+N, Crtl+O, Crtl+S, Crtl+Z and Crtl+Q now work.

Version 1.0
First version written in C language.

When AI plays line 1 at depth 14 with the board
-5 0 0 0 0 0 value
 0 0 0 0 0 0 delay
 1 0 0 0 0 0 score 10
 0 1 1 1 1 0 score 33
 0 8 8 6 10 0 delay
 0 5 5 0 5 0 value
he plays 5 instead of 3 ! A cyclic game is found and AI never
find the end of the game.
The reason is that AI discovers that playing 5, it also wins 
after 14 turns. And since the delay of 5 is greater than those
of 2 and 3, it chooses 5. After 12 turns, it comes back to the
same position and do again the same reasoning !

The board 
10 1 2  1  1 3
1  0 10 10 8 1
played with -d 1 -c 2 -l 1 leads to an unreasonable CPU time !

2 bugs reported.

----------------------------------------------------------------------
Copyright information:

Copyright (C) 1992, 1993, 1996 Free Software Foundation, Inc.

   Permission is granted to anyone to make or distribute verbatim copies
   of this document as received, in any medium, provided that the
   copyright notice and this permission notice are preserved,
   thus giving the recipient permission to redistribute in turn.

   Permission is granted to distribute modified versions
   of this document, or of portions of it,
   under the above conditions, provided also that they
   carry prominent notices stating who last changed them.

Local variables:
version-control: never
mode: indented-text
end:
