Heuristics in programming of nondeterministic games

被引：4

作者：

Melnikov, BF ^{[1
]}

机构：

[1] IN Ulyanov State Univ, Dept Math & Mech, Ulyanovsk 432700, Russia

来源：

PROGRAMMING AND COMPUTER SOFTWARE | 2001年 / 27卷 / 05期

基金：

俄罗斯基础研究基金会;

关键词：

Neural Network; Operating System; Artificial Intelligence; Classical Approach; Simple Game;

D O I：

10.1023/A:1012345111076

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In the paper, an approach to programming of nondeterministic antagonistic games is considered. This approach may be viewed as a generalization of the classical approach used for deterministic games (chess and the like) and is alternative to neural network methods of programming, which are usually applied to nondeterministic games. As examples of nondeterministic games, the very simple game omega and classical backgammon are considered. Results of programming these games are briefly discussed.

引用

页码：277 / 288

页数：12