🚀 go-pugleaf

We are a group of sophomores at the Computer Science Dept of the Indian
Institute of Technology (IIT) at Bombay. As a summer vacation activity,
we are trying to write a distributed version of the game-tree search of
GNUchess (We have the code of version 4.0 installed on our machine).

  However, the documentation we have is insufficient (we have just what
is provided in the "doc" directory with the package , no printed material)
and the comments do not seem to be enough to explain the  algorithm well
enough. All we know is that it uses the alpha-beta algorithm to search the
tree ; we don't even know whether it uses the original algorithm straightaway
or uses a variation of it !

  Although our project is restricted to the search routines only, there
are so many global variables involved (& so few comments to explain
their use) that we are totally at sea.

  We would really be thankful to you if you could send us help in any
form ( documentation, hints etc) or if you could lend us clues as to who
to contact for this purpose. If you are interested, you could even work
with us. Our e-mail address for this purpose is 
    summer93@cse.iitb.ernet.in
Without your help, the project may never materialise.

  Thanking you in anticipation,
                                     the gnuchess project group.