The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Realization of the Chess Mate Solver Application”

Hercules versus Hidden Hydra Helper

Jiří Matoušek, Martin Loebl (1991)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

L. Kirby and J. Paris introduced the Hercules and Hydra game on rooted trees as a natural example of an undecidable statement in Peano Arithmetic. One can show that Hercules has a “short” strategy (he wins in a primitively recursive number of moves) and also a “long” strategy (the finiteness of the game cannot be proved in Peano Arithmetic). We investigate the conflict of the “short” and “long” intentions (a problem suggested by J. Nešetřil). After each move of Hercules (trying to kill...

Galvin Tree-Games

E. C. Milner (1985)

Publications du Département de mathématiques (Lyon)

Similarity:

Evolving small-board Go players using coevolutionary temporal difference learning with archives

Krzysztof Krawiec, Wojciech Jaśkowski, Marcin Szubert (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

We apply Coevolutionary Temporal Difference Learning (CTDL) to learn small-board Go strategies represented as weighted piece counters. CTDL is a randomized learning technique which interweaves two search processes that operate in the intra-game and inter-game mode. Intra-game learning is driven by gradient-descent Temporal Difference Learning (TDL), a reinforcement learning method that updates the board evaluation function according to differences observed between its values for consecutively...

Diversity of logical agents in games

Johan van Benthem, Fenrong Liu (2004)

Philosophia Scientiae

Similarity:

Epistemic agents may have different powers of observation and reasoning, and we show how this diversity fits into dynamic update logics.

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

Joanna Kołodziej, Fatos Xhafa (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies,...