Probabilistic neural network playing and learning Tic-Tac-Toe

Authors:
Jiří Grim;Petr Somol;Pavel Pudil
Affiliations:
Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, P.O. Box 18, CZ-18208 Prague 8, Czech Republic;Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, P.O. Box 18, CZ-18208 Prague 8, Czech Republic;Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, P.O. Box 18, CZ-18208 Prague 8, Czech Republic
Venue:
Pattern Recognition Letters - Special issue: Artificial neural networks in pattern recognition
Year:
2005

Citing 3
Cited 1

Temporal difference learning and TD-Gammon

Communications of the ACM
Co-Evolution in the Successful Learning of Backgammon Strategy

Machine Learning
A view of the EM algorithm that justifies incremental, sparse, and other variants

Learning in graphical models

2008 Special Issue: Iterative principles of recognition in probabilistic neural networks

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A probabilistic neural network is applied as a tool to approximate the statistical evaluation function for a simple version of the game Tic-Tac-Toe. We solve the problem by a sequential estimation of the underlying discrete distribution mixture of product components.