LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Andrist, R.B.; Haworth, G.McC. (2005)
Publisher: Elsevier BV
Journal: Theoretical Computer Science
Languages: English
Types: Article
Subjects: Theoretical Computer Science, Computer Science(all)
A reference model of Fallible Endgame Play has been implemented and exercised with the chess-engine WILHELM. Past experiments have demonstrated the value of the model and the robustness of decisions based on it: experiments agree well with a Markov Model theory. Here, the reference model is exercised on the well-known endgame KBBKN.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] R. Andrist. http://www.geocities.com/rba_schach2000/. WILHELM download, 2004.
    • [2] M. Bourzutschky. Private communication of generalized EGT-management code, 2003.
    • [3] D.M. Breuker, L.V. Allis, H.J. van den Herik, I.S.Herschberg. A Database as a Second., ICCA Journal 15 (1) (1992) 28-39.
    • [4] W. Feller. An Introduction to Probability Theory and its Applications, Vol. 1. Wiley, 1968. ISBN 0-4712-5708-7.
    • [5] C.J. Fenner. Computer Chess, News about the North American Computer Chess Championship, The British Chess Magazine 99 (5) (1979) 193-200.
    • [6] G.McC Haworth. Reference Fallible Endgame Play, in: J.W.H.M. Uiterwijk (Ed.), Proceedings of the Seventh Computer Olympiad Computer-Games Workshop, Maastricht, Report CS-02-03, 2003.
    • [7] G.McC Haworth. Reference Fallible Endgame Play, ICGA Journal 26 (2) (2003) 81-91.
    • [8] G.McC Haworth, R.B. Andrist. Model Endgame Analysis, in: H.J. van den Herik, H. Iida, and E.A. Heinz (Eds.), Advances in Computer Games 10, Kluwer Academic Publishers, Norwell, MA, 2003, pp. 65-79. ISBN 1-4020-7709-2.
    • [9] P.J. Jansen. KQKR: Awareness of a Fallible Opponent, ICCA Journal 15 (3) (1992) 111-131.
    • [10] D. Levy, M. Newborn. How Computers Play Chess, esp. pp. 144-148, 1991.
    • [11] A.J. Roycroft. Expert against the Oracle, in: J.E. Hayes, D. Michie and J. Richards (Eds), Machine Intelligence 11, Oxford University Press, Oxford, 1988, pp. 347-373.
    • [12] J. Tamplin, J. Private communication of some pawnless Nalimov-compatible DTC EGTs, 2001.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article