David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Minds and Machines 5 (4):489-498 (1995)
We consider a special case of heuristics, namely numeric heuristic evaluation functions, and their use in artificial intelligence search algorithms. The problems they are applied to fall into three general classes: single-agent path-finding problems, two-player games, and constraint-satisfaction problems. In a single-agent path-finding problem, such as the Fifteen Puzzle or the travelling salesman problem, a single agent searches for a shortest path from an initial state to a goal state. Two-player games, such as chess and checkers, involve an adversarial relationship between two players, each trying to win the game. In a constraint-satisfaction, problem, such as the 8-Queens problem, the task is to find a state that satisfies a set of constraints. All of these problems are computationally intensive, and heuristic evaluation functions are used to reduce the amount of computation required to solve them. In each case we explain the nature of the evaluation functions used, how they are used in search algorithms, and how they can be automatically learned or acquired.
|Keywords||Artificial intelligence heuristics search two-player games constraint-satisfaction|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Włodzisław Duch (2007). What is Computational Intelligence and Where is It Going? In Wlodzislaw Duch & Jacek Mandziuk (eds.), Challenges for Computational Intelligence. Springer 1--13.
David Kirsh (2009). Problem Solving and Situated Cognition. In Philip Robbins & M. Aydede (eds.), The Cambridge Handbook of Situated Cognition. Cambridge 264--306.
Thomas Bartz-Beielstein (2008). How Experimental Algorithmics Can Benefit From Mayo's Extensions to Neyman–Pearson Theory of Testing. Synthese 163 (3):385 - 396.
Benjamin Goertzel & Pei Wang (eds.) (forthcoming). Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms. Proceedings of the AGI Workshop 2008. Frontiers in Artificial Intelligence and Applications. IOS Press: Amsterdam.
James Mensch (2006). Artificial Intelligence and the Phenomenology of Flesh. Phaenex 1 (1):73-85.
Alison Chorley & Trevor Bench-Capon (2005). Agatha: Using Heuristic Search to Automate the Construction of Case Law Theories. [REVIEW] Artificial Intelligence and Law 13 (1):9-51.
Alexei V. Samsonovich, Giorgio A. Ascoli, Harold Morowitz & M. Layne Kalbfleisch (forthcoming). A Scientific Perspective on the Hard Problem of Consciousness. In Benjamin Goertzel & Pei Wang (eds.), Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms. Proceedings of the AGI Workshop 2008. Frontiers in Artificial Intelligence and Applications. IOS Press: Amsterdam
Christian Huyck & Ian Mitchell (2005). It is Not Evolution, but a Better Game Would Need a Better Agent. Behavioral and Brain Sciences 28 (4):499-500.
Sherlock Holmes, Searching in a Maze, in Search of Knowledge: Issues in Early Artiﬁcial Intelligence.
Edwina L. Rissland, David B. Skalak & M. Timur Friedman (1996). BankXX: Supporting Legal Arguments Through Heuristic Retrieval. [REVIEW] Artificial Intelligence and Law 4 (1):1-71.
Added to index2009-01-28
Total downloads23 ( #172,152 of 1,911,732 )
Recent downloads (6 months)2 ( #322,396 of 1,911,732 )
How can I increase my downloads?