Cluster communication protocols for parallel-programming systems
ACM Transactions on Computer Systems (TOCS)
A Million-Fold Speed Improvement in Genomic Repeats Detection
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Science of Computer Programming
Dynamic photonic lightpaths in the StarPlane network
Future Generation Computer Systems
Deterministic Graphical Games Revisited
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A Retrograde Approximation Algorithm for Multi-player Can't Stop
CG '08 Proceedings of the 6th international conference on Computers and Games
Large-Scale Parallel Computing on Grids
Electronic Notes in Theoretical Computer Science (ENTCS)
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Intensional dynamic programming. A Rosetta stone for structured dynamic programming
Journal of Algorithms
A retrograde approximation algorithm for one-player can't stop
CG'06 Proceedings of the 5th international conference on Computers and games
Partial information endgame databases
ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
Automatic generation of search engines
ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
Evaluation of a simple, scalable, parallel best-first search strategy
Artificial Intelligence
| Hi-index | 4.10 |
In Awari, a two-person game of pure skill, players sow stones into pits on a board. The game's rules define how to capture stones, and the player who captures the most wins the game.For more than a decade, researchers have studied computerized techniques to play Awari. The authors have now solved the game by determining the score of 889,063,398,406 board positions and storing them in databases. They performed the necessary computations on a 144-processor parallel computer with 72 gigabytes of main memory and a fast Myrinet interconnect.