This version of the AI Game Server includes several minor updates to documentation (mostly to reflect the changes outlined below in the server) and a few changes (including one major change) to the server.
First, the server has been changed to send the final move along with GameOver moves, primarily for bookkeeping on the part of the clients.
The documentation has not changed for this version; however, a few relatively major updates have been made to the server code.
First, the second player swap rule has been implemented to prevent either player from having an easily implemented perfect strategy. Now, after the first player has played, the second player can choose to either continue the game as normal or to switch places with the first player.
Next, a 4th argument has been added to the JoinSuccess and GameState messages to tell the client if they are player 1 or player 2.
This is the first version of both the AI Game Server documentation and code. To write a client for the AIGS, I would suggest reading the documentation, it should contain all you need to connect to and interact with the server.
If you run the included jar file, it will run a working copy of the server. This version of the server does not contain a complete GUI, I hope to have that in a few days; however, a working version of Hex is included. If you would like to see the source cope, just open the jar file, all of the source code is included.
Another project we had during my first Winter quarter at Rose-Hulman was to use a finite state machine to colorize / perform syntax highlighting on Java source code. It’s easy enough as there are really 3 special cases that we are looking for (strings, comments, and keywords) and we only need 9 states to recognize them all (at least in my implementation).
This is work from my first Winter quarter at Rose-Hulman Institute of Technology. Basically, we were to use Markov chains to generate a semi-random text that statistically matches an input text. The short version is that you calculate for each sequence of words of a given length (the chain length) what the possible next words are from the given text, each with a given probability. Then you use that to generate a new text, randomly choosing each new word from the aforementioned probabilities. It’s really fun to play with and I’ve got a half dozen or so examples to show you.