Pwned includes a partial set of Gaviota 5 man end game table bases. This pushes the size of the download to 500 Megs, the maximum allowed on the Xbox Live Indie games channel. Anyone who owned a prior version will get this update free.
Avatars and avatar animations
Up to 16 players can join a game via system link or Xbox Live
Single player AI
Go online and play vs AI while you wait for a human opponent to join
Local play supported with one or more controllers
End Game Table Base helper during human vs human games
Accolades awarded for various feats of strength
Help file with introductory chess tactics
Generate FEN strings using QR codes
Save & load games including complete move history
Create or edit board layouts, alter game flags
3D or 2D environments
Customizable sky, ground and chess boards
Classical guitar soundtrack
Download directly to your console for 240 MS points, or get the free trial.
The Windows version of Pwned is a console application that speaks a subset of two popular chess engine communications protocols. Find out more about how the engine was made or visit the download page to get the windows version.
Pwned uses Gaviota end game table bases to speed up searches, and to show hints when there are only a few pieces left. The C# probing code for Gaviota table bases from Pwned is available under the open source MIT license.
The Pwned opening book can stay closed on disk and be decompressed on the fly as parts of it are needed. The book was generated using 2 Million PGN files from actual games, including many of the top ranked players in the history of chess. You can also get the Pwned opening book in Polyglot format.
You can generate your own board diagrams by pasting a FEN string into the field at the top of this page and pressing ENTER. QR codes generated by Pwned will link to the Pwned FEN Display tool. Images are produced using the totally awesome ChessImager software by Steve Eddins. The developers made extensive use of a FEN display tool created at the University of New Brunswick by Richard Tervo.
These slides provide a walkthough of the MinMax and NegaMax search algorithms. These slides was extracted from this animated gif courtesy of Wikipedia. You can step through each slide of the MinMax or Negamax algorithm at your own pace to understand how a chess engine navigates a seemingly infinite game state space.
To help increase your confidence level your engines end game logic, you can compare many thousands (or millions) of game endings against another engine. This Python script will collect PGN files that can be used for this purpose. It uses PyChess to group chess games based on how they ended.
If you need way to convert standard algebraic notation into coordinate notation in C# here is a code example. You need to connect this to your own board classes so that move ambiguity can be resolved.