返回
Knowledge-based search in competitive domains
DOI:10.1109/TKDE.2003.1198402.png)
摘要
En 中文
Artificial Intelligence programs operating in competitive domains typically use brute-force search if the domain can be modeled using a search tree or alternately use nonsearch heuristics as in production rule-based expert systems. While brute-force techniques have recently proven to be a viable method for modelin g domains with smaller search spaces, such as checkers and chess, the same techniques cannot succeed in more complex, domains, such as shogi or go. This research uses a cognitive-based modeling strategy to develop a heuristic search technique based on cognitive thought processes With minimal domain specific knowledge. The cognitive-based search technique provides a-significant reduction in search space complexity and, furthermore enables the search paradigms to be extended to domains that are not typically thought of as search domain's such as aerial combat or corporate takeovers.
Keyword:
search
knowledge-based
chunking
opponent modeling
heuristic pruning
chess
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
Cyclic-AMP-dependent phosphorylation of voltage-sensitive sodium channels in primary cultures of rat brain neurons.大鼠脑神经元原代培养物中电压敏感钠通道的环AMP依赖性磷酸化。
Neuroendocrine Tumor (Carcinoid) Metastatic to Orbital Extraocular Muscle: Case Report and Literature Review
Strabismus
IF0

