Searching solitaire in real time

ICGA Journal

Volumn 30, Issue 3, 2007, Pages 131-142

  Bjarnason, Ronald ^a   Tadepalli, Prasad ^a   Fern, Alan ^a,b  

^a Oregon State University ^*

^b Oregon State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS;

HEURISTIC SEARCH METHODS; PLANNING PROBLEM; REAL TIME; ROLLOUT ALGORITHMS; SEARCH PROCESS; SEARCH TREES; SOLITAIRE GAME; STATE REPRESENTATION;

HEURISTIC METHODS;

EID: 37149054260     PISSN: 13896911     EISSN: None     Source Type: Journal    
DOI: 10.3233/icg-2007-30302     Document Type: Article

References (18)

1. Barto, A. G., Bradtke, S. J., and Singh, S. P. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence, Vol. 72, Nos. 1-2, pp. 81-138. ISSN 0004-3702.
2. Baxter, J., Tridgell, A., and Weaver, L. (2000). Learning to Play Chess Using Temporal Differences. Machine Learning, Vol. 40, No. 3, pp. 243-263. ISSN 0885-6125.
3. Behnke, D. (2007). Deep Logic, http://www.codeplex.com/deeplogic.
4. Bertsekas, D. and Tsitsiklis, J. (1996). Neuro-Dynamic Programming. Athena Scientific, Boston, Massachusetts. ISBN 1-886529-10-8.
5. Bjarnason, R. (2007). K+ Solitaire. http://web.engr.oregonstate.edu/ ~ronny/k.html.
6. Bonet, B. and Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, Vol. 129, Nos. 1-2, pp. 5-33. ISSN 0004-3702.
7. Bonet, B., Loerincs, G., and Geffner, H. (1997). A Robust and Fast Action Selection Mechanism for Planning. Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97), pp. 714-719, AAAI Press / MIT Press, Providence, Rhode Island. ISBN 0-262-51095-2.
8. Chang, H. S., Givan, R., and Chong, E. K. P. (2004). Parallel Rollout for Online Solution of Partially Observable Markov Decision Processes. Discrete Event Dynamic Systems, Vol. 14, No. 3, pp. 309-341. ISSN 0924-6703.
9. Cronin, D. (2007). Winnable Solitaire, http://winnablesolitaire.com.
10. Doug (2007). Cracking Solitaire. http://crackingsolitaire.blogspot.com.
11. Fish, S. (2005). Freecell Solver, http://www.shlomifish.org/freecell- solver/.
12. Hoffmann, J. and Nebel, B. (2001). The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research, Vol. 14, pp. 253-302. ISBN 1558608575.
13. Korf, R. E. (1990). Real-time heuristic search. Artificial Intelligence, Vol. 42, Nos. 2-3, pp. 189-211. ISSN 0004-3702.
14. Kulow, S. (2006). More Info Revision 602069. http://www.commit-digest. org/issues/2006-11-12/moreinfo/602069/.
15. Tesauro, G. and Galperin, G. (1996). On-line Policy Improvement Using Monte-Carlo Search. Advances in Neural Information Processing Systems 9, pp. 1068-1074, MIT Press, Cambridge, MA. ISBN 0262100657.
16. Tesauro, G. (1995). Temporal difference learning and TD-Gammon. Communications of the ACM, Vol. 38, No. 3, pp. 58-68. ISSN 0001-0782.
17. Yan, X., Diaconis, P., Rusmevichientong, P., and Van Roy, B. (2005). Solitaire: Man Versus Machine. Advances in Neural Information Processing Systems 11 (eds. L. K. Saul, Y. Weiss, and L. Bottou), pp. 1553-1560, MIT Press, Cambridge, MA. ISBN 0262195348.
18. Yoon, S., Fern, A., and Givan, R. (2005). Learning Measures of Progress for Planning Domains. Proceedings of the Twentieth National Conference of Artificial Intelligence (AAAI-05), pp. 1217-1222, AAAI Press, Menlo Park, CA. ISBN 157735236X.