Description: everlasting General existing 21 matches, two from rotation, each person could take from one to four, not to take on more. nor can we obtain, who take a final flourishing Who loses matches. Please procedures for the preparation of a human-machine game, the first to ask for and obtain computer; One computer to "everlasting generals."* Analysis and design of algorithms in the computer after taking the circumstances, in order to make the computer as "everlasting generals" must find out from the key. According to the requirements of this title to sum up their thoughts, after taking one for the number of children with each other- just one step and the amounts equal to, Finally we can guarantee a first son left for the children it is personal. Accordingly analysis algorithm
To Search:
- [puker0411scott] - This is a practice Chain cards procedure
- [TLink] - carefully chain operation, a one-way pai
- [STEWAR.war] - parallel robot source for research robot
- [zhaomigong_c] - simple demonstration, N size can be chan
- [counter99] - all passed, I was carefully designed, fu
- [2006102411] - election monkey king, c language, the so
- [huochai] - Check matches with the computer games an
- [wuziqi] - Gobang ordinary games, only two games, c
- [Othello] - I use Borland C++ Builder 6 Riversi writ
File list (Check if you may need any files):
Download