文章基本信息

标题：Familiarising Probabilistic Distance Clustering System of Evolving Awale Player
本地全文：下载
作者：Randle Oluwarotimi Abayomi ; Keneilwe Zuva
期刊名称：International Journal on Applications of Graph Theory in Wireless ad hoc Networks and Sensor Networks
印刷版ISSN：0975-7260
电子版ISSN：0975-7031
出版年度：2012
卷号：4
期号：2/3
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：This study developed a new technique based on Probabilistic Distance Clustering (PDC) for evolving Awale player and to compare its performance with that of a technique based on approximation of minimum and maximum operators with generalized mean-value operator. The basic theory of pd-clustering is based on the assumption that the probability of an Euclidean point belonging to a cluster is inversely proportional to its distance from the cluster centroid. Treating game strategies as a vector space model, it is possible to extend pd-clustering technique to game playing by estimating the probability that a given strategy is in a certain cluster of game strategies. As a result, the strategy that has the highest probability and shortest distance to a cluster of alternative strategies is recommended for the player.
关键词：Minimax Search; Mahalanobis Distance; Hybrid ; Awale