The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - May/June (2003 vol.15)
pp: 734-743
ABSTRACT
<p><b>Abstract</b>—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 modeling 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 domains such as aerial combat or corporate takeovers.</p>
INDEX TERMS
Search, knowledge-based, chunking, opponent modeling, heuristic pruning, chess.
CITATION
Steven Walczak, "Knowledge-Based Search in Competitive Domains", IEEE Transactions on Knowledge & Data Engineering, vol.15, no. 3, pp. 734-743, May/June 2003, doi:10.1109/TKDE.2003.1198402
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool