Eduardo Morales. Learning playing strategies in chess. Computational Intelligence, 12(1):65--87, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Learning Minesweeper with Multirelational Learning - Castillo, Wrobel (Correct)
....mines. Its winning rate is also 60 . 5.2 Multirelational Learning for Games Other work has been done which applies ILP systems to learn heuristics or playing strategies for games. Ramon et al. 2001] used Tilde [Blockeel and Raedt, 1998] to learn a theory that predicts the value of a move in Go. Morales [1996] applied the system PAL to learn chess patterns for constructing chess playing strategies. Nakano et al. 1998] presented an approach to generate an evaluation function for Shogi mating problems using ILP. 6 Conclusions and Future Work In this paper we described how the use of new ILP techniques ....
Eduardo Morales. Learning playing strategies in chess. Computational Intelligence, 12(1):65--87, 1996.
Inductive Inference of Chess Player Strategy - Jansen, Dowe, Farr (2000) (Correct)
.... This is usually achieved by the use of appropriate search algorithms together with some explicit coding of human knowledge about strategies for the game (Shannon, 1950) although learning methods have also been used (Samuel, 1959, draughts checkers; recent chess examples include Thrun, 1995, Morales, 1996). In this paper we go in an opposite direction. Starting from records of games played, we wish to infer something about the strategy used. This is clearly a machine learning problem, but different to problems of improving play by learning from experience. We approach the problem in two steps. ....
Morales, E.M. (1996). Learning playing strategies in chess, Computational Intelligence, 12 (1), 65--87.
Knowledge Discovery in Chess Databases: A Research Proposal - Fürnkranz (Correct)
....of algorithms that are able to make use of background knowledge in full first order horn clause logic. Roughly speaking, these algorithms are concerned with the induction of PROLOG programs. The ability to use background knowledge in the form of PROLOG clauses allows systems such as PAL [Morales, 1996] to formulate rules with complex predicates in the background knowledge. The rules may even employ a limited look ahead by including conditions like make move(Side,Piece,From,To,Pos,NewPos) and looking for discriminating patterns in the new position that results from the specified move. We ....
Eduardo Morales. Learning playing strategies in chess. Computational Intelligence, 12(1):65--87, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC