Richard+Korf

an American computer scientist at the [|University of California, Los Angeles]. He received his B.S. from MIT in 1977, and his M.S. and Ph.D. from Carnegie Mellon University in 1980 and 1983. His research is in the areas of problem-solving, heuristic search, and planning in artificial intelligence. || toc =Selected Publications=
 * Home * People * Richard Korf**
 * [[image:richard.korf.jpg link="http://courseweb.seas.ucla.edu/classView.php?term=09S&srs=587620208"]] ||~  || **Richard Earl Korf**,
 * Richard Korf  ||~   ||^  ||

1984 ...

 * Richard Korf (**1984**). //The Complexity of Brute Force Search//. Technical Report, Department of Computer Science, Columbia University
 * Richard Korf (**1985**). //Depth-first Iterative-Deepening: An Optimal Admissible Tree Search//. [|pdf] from [|CiteSeerX]
 * Richard Korf (**1985**). //Learning to solve problems by searching for macro-operators.// Pitman.
 * Richard Korf (**1985**). //Macro-operators: A weak method for learning.// [|Artificial Intelligence], Vol. 26, No. 1, pp. 35-77. ISSN 0004-3702.
 * Jens Christensen, Richard Korf (**1986**). //A Unified Theory of Heuristic Evaluation functions and Its Applications to Learning.// Proceedings of the [|AAAI-86], pp. 148-152, [|pdf].
 * Richard Korf (**1987**). //Planning as Search: A Quantitative Approach.// [|Artificial Intelligence], Vol. 33, pp. 65-88.
 * Bruce Abramson, Richard Korf (**1987**). //A Model of Two-Player Evaluation Functions.// [|AAAI-87]. [|pdf]
 * [|Chris Ferguson], Richard Korf (**1988**). //Distributed Tree Search and its Application to Alpha-Beta Pruning.// [|AAAI-88], [|pdf]

1990 ...

 * Richard Korf (**1993**). //Linear-Space Best-First Search.// [|Artificial Intelligence], Vol. 62, No. 1, [|pdf]
 * Richard Korf, Max Chickering (**1993**). //[|Best-first Minimax Search: First Results].// [|AAAI'93]
 * Weixiong Zhang, Richard Korf (**1993**). //[|Depth-first vs. best-first search: New results]//. [|AAAI'93]
 * Richard Korf, Max Chickering (**1994**). //[|Best-first minimax search: Othello results].// [|AAAI-94], [|pdf]
 * Richard Korf, Max Chickering (**1996**). //[|Best-first minimax search]//. [|Artificial Intelligence], Vol. 84, No 1-2
 * Richard Korf (**1997**). //Finding Optimal Solutions to Rubik’s Cube Using Pattern Databases.// [|AAAI-97], [|pdf]
 * Richard Korf (**1997**). //Does Deep Blue use AI?// Proceedings of the AAAI-97 Workshop on Deep Blue vs. Kasparov : The Significance for Artificial Intelligence (ed. R. Morris), pp. 1-2. Providence, RI. [|pdf]
 * Richard Korf (**1997**). //Does DEEP BLUE use Artificial Intelligence?// ICCA Journal, Vol. 20, No. 4

2000 ...

 * Richard Korf (**2000**). //Finding Optimal Solution to Rubik’s Cube Using Pattern Databases.// Games in AI Research (eds. Jaap van den Herik and Hiroyuki Iida), pp. 125-137. Universiteit Maastricht, Maastricht, The Netherlands. ISBN 90-621-6416-1.
 * Nathan Sturtevant, Richard Korf (**2000**). //On Pruning Techniques for Multi-Player Games.// [|AAAI-2000], [|pdf]
 * Richard Korf, Ariel Felner (**2002**). //Disjoint Pattern Database Heuristics//. in “Chips Challenging Champions: Games, Computers and Artificial Intelligence”, 13-26, Edited by Jonathan Schaeffer and Jaap van den Herik. Elsevier Science
 * Ariel Felner, Richard Korf, Ram Meshulam, Robert Holte (**2007**). //Compressed Pattern Databases//. [|JAIR], Vol. 30, [|pdf]
 * Richard Korf, Ariel Felner (**2007**). //Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem//. [|IJCAI-07], [|ps]

=External Links= > media type="custom" key="24782300"
 * [|Richard Korf's Home Page]
 * [|The AI Genealogy Project :: Richard Korf]
 * [|UCLA Professor Uses Artificial Intelligence Program to Solve Rubik's Cube in Minimum Number of Moves], May 19, 1997
 * [|Rubik's Cube from Wikipedia]
 * [|Carnegie Mellon UniversityDepartment of Computer Science - AI Seminar 97/98 Schedule]
 * Rich Korf at Judea Pearl Symposium, 2010, [|YouTube] Video

=References= =What links here?= include page="Richard Korf" component="backlinks" limit="80"
 * Up one level**