![]() Note however that we have defined more precisely the criteria for winning, and adopted a time limit for the programs to make its moves, which are intended to make the games more interesting. Thus the rules are here only for reference purposes and should correspond to everyone's understanding of the game. Specifically, we will adopt for the contest the simpliest version of the game in which the objective is to move all of ones marbles across the board as quickly as possible. ![]() This document describes the rules of Chinese checkers and the protocol understood by the mediator program.Įveryone must have played Chinese checkers at one time or another. ![]() While teams compete in the programming contest, at another location of the contest site a competition will be held for Chinese checkers playing programs, which are to be written and submitted before contest day.ĭuring each game, two Chinese checkers playing programs, executing as separate processes on personal computers or workstations running Unix, play against each other using a common protocol mediated by the organizer's ``mediator program'' executing as yet another process. Introduction to Chinese Checkers CompetitionĪ computer Chinese checkers competition will be held during the 1997 Annual ACM Hong Kong Chapter Scholastic Programming Contest. AAAI Press, Vancouver, British Columbia, Canada, Jul 2007.1997 ACM Hong Kong Chapter Computer Chinese Checkers Competition Rules 1997 ACM Hong Kong Chapter Computer Chinese Checkers Competition In: Twenty-Second AAAI Conference on Artificial Intelligence (AAAI), pp. Zhou, R., Hansen, E.A.: Parallel structured duplicate detection. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. Sturtevant, N., Rutherford, M.: Minimizing writes in parallel external memory search. Sturtevant, N.: Multi-player games: Algorithms and approaches. In: Cazenave, T., Winands, M.H.M., Saffidine, A. Sturtevant, N.R., Saffidine, A.: A study of forward versus backwards endgame solvers with results in chinese checkers. In: Schaeffer, J., Müller, M., Björnsson, Y. Sturtevant, N.: A comparison of algorithms for multi-player games. In: IJCAI Workshop on Computer Games (2015) Sturtevant, N.: Challenges and progress on using large lossy endgame databases in chinese checkers. Silver, D., et al.: A general reinforcement learning algorithm that masters chess, shogi, and go through self-play. Schaeffer, J., et al.: Checkers is solved. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. ![]() Schaeffer, J., Björnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the checkers 10-piece endgame databases. Schadd, M.P., Winands, M.H.: Best reply search for multiplayer games. In: Cazenave, T., Winands, M.H.M., Iida, H. Roschke, M., Sturtevant, N.R.: UCT enhancements in chinese checkers using an endgame database. Romein, J.W., Bal, H.E.: Solving awari with parallel retrograde analysis. In: AAAI Conference on Artificial Intelligence, pp. Korf, R.E.: Minimizing disk i/o in two-bit breadth-first search. In: Twenty-First International Joint Conference on Artificial Intelligence (2009) Henderson, P., Arneson, B., Hayward, R.B.: Solving 8x8 hex. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. Sage, Thousand Oaks (2009)Įdelkamp, S., Kissmann, P.: Symbolic classification of general two-player games. Ĭarlisle, R.P.: Encyclopedia of Play in Today’s Society, vol. In: van den Herik, H.J., Hsu, S.-C., Hsu, T.-S., Donkers, H.H.L.M.J. thesis, Vrije Universiteit (1988)ījörnsson, Y., Schaeffer, J., Sturtevant, N.R.: Partial information endgame databases. thesis, Maastricht University (1994)Īllis, V.: A knowledge-based approach of Connect-Four-the game is solved: White wins. Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence.
0 Comments
Leave a Reply. |