Author: Ilya P. Kozachenko
Date: 15:33:11 01/17/99
Huge hi! All that promised heap of Computer Chess publications is available now for download! Please, refer to my home page: www.hoggy.cjb.net and you will be able to access any of this: 1. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "Best-First Fixed-Depth Game-Tree Search in Practice", 1995, 7p. 2. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "An Algorithm Faster than NegaScout and SSS* in Practice", 1995, 14p. 3. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "A New Paradigm for Minimax Search", 1994, 27p. 4. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "A Minimax Algorithm Better than Alpha-Beta ? No and Yes", 1995, 50p. 5. Herbert A. Simon, Jonathan Schaeffer: "The Game of Chess", 1992, 18p. 6. Jonathan Schaeffer, Paul Lu, Duane Szafron, Robert Lake: "A Re-Examination of Brute-Force Search", 1993, 8p. 7. David A. McAllester, Deniz Yuret: "Alpha-Beta-Conspiracy Search", 1993, 39p. 8. Norbert Klingbeil, Jonathan Schaeffer: "Empirical Results with Conspiracy Numbers", 1990, 32p. 9. Lisa Lister, Jonathan Schaeffer: "An Analysis of the Conspiracy Numbers Algorithm", 1994, 37p. 10. Jonathan Schaeffer: "The History Heuristic and Alpha-Beta Search Enhancements in Practice", 1989, 28p. 11. Alexander Reinefeld: "Complete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA*", 1993, 6p. 12. Alexander Reinefeld, T.Anthony Marsland: "Enhanced Iterative-Deepening Search", 1994, 19p. 13. Alexander Reinefeld, Peter Ridinger: "Time-Efficient State Space Search*", 1994, 13p. 14. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "Exploiting Graph Properties of Game Trees", 1996, 6p. 15. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "Best-First Fixed-Depth Minimax Algorithms", 1996, 40p. 16. Aske Plaat, Jonathan Schaeffer: "New Advances in Alpha-Beta Searching", 1996, 7p. 17. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "Best-First and Depth-First Minimax Search in Practice", 1995 (less technical version of 2.), 12p. 18. Aske Plaat, Wim Pijls, Arie de Bruin: "Solution Trees as a Basis for Game Tree Search", 1994 (in ICCA Journal, see also 24.), 19p. 19. Aske Plaat, Charles E. Leiserson: "Programming Parallel Applications in Cilk", 1998, 11p. 20. Aske Plaat: "Research Re: search & Re-search", 1996 (Ph.D. Thesis), 182p. 21. Aske Plaat, Wim Pijls, Arie de Bruin: "A theory of game trees, based on solution trees", 1996, 36p. 22. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "SSS* = Alpha-Beta + TT", 1994, 36p. 23. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "Nearly Optimal Minimax Tree Search ?", 1994, 17p. 24. Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin: "Solution Trees as a Basis for Game Tree Search", 1994 (tech report), 17p. 25. Bradley C. Kuszmaul: "The StarTech Massively Parallel Chess Program", 1995, 15p. 26. compiled by J.Uiterwijk: "ICCA Journal: Tablebase of contents", September 1996, 8p. 27. Dennis M. Breuker, Jos W.H.M. Uiterwijk: "Transposition Tables in Computer Chess", University of Limburg, 11p. 28. D.M.Breuker, J.W.H.M.Uiterwijk, H.J. van den Herik: "Replacement Schemes for Transposition Tables", Maastricht, The Netherlands, 14p. 29. D.M.Breuker, J.W.H.M.Uiterwijk, H.J. van den Herik: "Replacement Schemes and Two-Level Tables", Maastricht, The Netherlands, 6p. 30. D.M.Breuker, J.W.H.M.Uiterwijk, H.J. van den Herik: "Information in Transposition Tables", University of Limburg, 13p. 31. Jos Uiterwijk: "Computer Chess: State of the Art", University of Limburg, 9p. 32. Dennis M. Breuker, H. Jaap van den Herik, L. Victor Allis, Jos W.H.M. Uiterwijk: "A Solution to the GHI Problem for Best-First Search", 18p. 33. D.M.Breuker, L.V.Allis, H.J. van den Herik: "Mate in 38: applying proof-number search to chess", 19p. 34. Martin Schijf: "Proof-Number Search and Transpositions", University of Leiden, August 1993 (Thesis), 58p. 35. Andreas Junghanns, Jonathan Schaeffer, Mark Brockington, Yngvi Bjornsson, Tony Marsland: "Diminishing Returns for Additional Search in Chess", 1997, 14p. 36. D.F.Beal, M.C.Smith: "Learning piece values using temporal differences", London, England, 7p. 37. Andreas Junghanns, Jonathan Schaeffer: "Search vs. Knowledge in game-playing programs revisited", University of Alberta, IJCAI'97, 6p. 38. Yngvi Bjornsson, Tony Marsland, Jonathan Schaeffer, Andreas Junghanns: "Searching with Uncertainty Cut-offs", University of Alberta, 1997, 11p. 39. Jonathan Schaeffer: "Basic Topics in Experimental Computer Science; Experimental Computer Science in Game Playing", 1997, 10p. 40. Markus Gille, Ernst A. Heinz: "DarkThought: competitive chess program", 1997, 52p. 41. Mikhail Donskoy, Jonathan Schaeffer: "Perspectives on Falling from Grace", 1989, 9p. 42. Michael George, Jonathan Schaeffer: "Chunking for Experience", in Advances in Computer Chess 6, 1991, 13p. 43. Mark G. Brockington, Jonathan Schaeffer: "APHID Game-Tree Search", 1996, 20p. 44. Ton Weijters, Antal van den Bosch, H. Jaap van den Herik: "Applying Ockham's Razor to Back-propagation", University of Maastricht, 18p. 45. Ulf Lorenz, Valentin Rottmann, Rainer Feldmann, Peter Mysliwietz: "Controlled Conspiracy Number Search", University of Paderborn, 16p. 46. Ulf Lorenz, Valentin Rottmann: "Parallel Controlled Conspiracy Number Search", University of Paderborn, 14p. 47. Jonathan Schaeffer: "Checkers: A preview of what will happen in chess ?", 1991, 10p. 48. Jurg Nievergelt, Ralph Gasser, Fabian Maser, Christoph Wirth: "All the needles in a haystack: Can exhaustive search overcome combinatorial chaos ?", Zurich, 21p. 49. Johannes Furnkranz: "Machine Learning in Computer Chess: The Next Generation", Austrian Research Institute for AI, 13p. 50. Joseph C. Culberson, Jonathan Schaeffer: "Searching with Pattern Databases", University of Alberta, 1996, 15p. 51. Hans J. Berliner, Chris McConnell: "B* Probability Based Search", Pittsburgh, CMU, 1995, 57p. 52. Michael Bain, Stephen Muggleton, Ashwin Srinivasan: "Generalising Closed World Specialisation: A chess end game application", Oxford University, 48p. 53. Jeffrey Gould, Robert Levinson: "Experience-Based Adaptive Search", University of California Santa Cruz, 1992, 26p. 54. Robert Levinson: "Experience-Based Creativity", University of California Santa Cruz, 36p. 55. Christopher D. Rosin, Richard K. Belew: "A Competitive Approach to Game Learning", CSE Department, University of California, San Diego, 10p. 56. Johannes Furnkranz: "Knowledge Discovery in Chess Databases: A Research Proposal", Austrian Research Institute for AI, 8p. 57. Michael Bain: "Learning Logical Exceptions in Chess", Ph.D. Thesis, University of Strathclyde, Glasgow, 1994, 212p. 58. Justin A. Boyan, Andrew W. Moore: "Generalisation in Reinforcement Learning: Safely Approximating the Value Function", Pittsburgh, CMU, 1995, 8p. 59. Robert Levinson: "General Game-Playing and Reinforcement Learning", University of California Santa Cruz, 1995, 33p. 60. Thomas G. Dietterich, Nicholas S. Flann: " Explanation-Based Learning and Reinforcement Learning: A Unified View", Utah and Oregon State Universities, 9p. 61. Jonathan Baxter, Andrew Tridgell, Lex Weaver: "KnightCap: A chess program that learns by combining TD(l ) with minimax search", Canberra, 1997, 16p. 62. Jonathan Baxter, Andrew Tridgell, Lex Weaver: "TDLeaf(l ): Combining Temporal Difference learning with game-tree search", Canberra, Australia, 5p. 63. Chris McConnell: "Tuning Evaluation Functions for Search", Pittsburgh, CMU School of Computer Science, 6p. 64. Andreas Junghanns: "Are there practical alternatives to alpha-beta?" ICCA Journal, 21(1):14-32, March 1997; rev. January 29, 1998. 65. A.Junghanns, Ch.Posthoff, and M.Schlosser: "Search With Fuzzy Numbers" Proceedings FUZZ IEEE/IFES '95, pp: 979-986, Yokohama, Japan, March 1995. 66. Andreas Junghanns: "Fuzzy Numbers in Search to Express Uncertainty" GOSLER Report 25/94 (BMFT-Verbundprojekt), Leipzig, Germany, September 1994. 67. Stephen J. J. Smith, Dana S. Nau: "An Analysis of Forward Pruning" Proc. AAAI-94, to appear. 68. Michael Patrick Frank: "Advances in Decision-Theoretic AI: Limited Rationality and Abstract Search" Massachusets Institute of Technology, May 1994. 69. Alois P. Heinz, Christoph Hense: "Bootstrap Learning of a -b -Evaluation Functions" Freiburg, Germany, 1993. 70. Evan Fletcher, Armand Prieditis: "Learning Approximately Admissible Heuristics in Two-Player Games" University of California, submitted to Machine Learning Journal, August 25, 1994. 71. Christopher Darrell Rosin: "Coevolutionary Search Among Adversaries" Univ. of California, San Diego, 1997, PhD Thesis. 72. Johannes Furnkranz: "Knowledge Discovery in Chess Databases: A Research Proposal" Austrian Research Institute for Artificial Intelligence, Wien, Austria, 1997. 73. Stephen J. J. Smith, Dana S. Nau: "Strategic Planning for Imperfect-Information Games" Papers from 1993 Fall Symposium, AAAI Press, 1993. 74. Subrata Ghosh, Ambuj Mahanti, Dana S. Nau: "ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm" University of Maryland, 1991. 75. David Carmel and Shaul Markovitch: "The M* Algorithm: Incorporating Opponent Models into Adversary Search" Israel Institute of Technology, Computer Science Department, March 1994. 76. Qiang Yang, Dana S. Nau, James Hendler: "Merging Separately Generated Plans with Restricted Interactions" Computational Intelligence, 8(2):648-676, Feb 92 77. Shaul Markovitch, Yaron Sella: "Learning of Resource Allocation Strategies for Game Playing" Israel Institute of Technology, Comp. Sc. Department, rev.May 93. 78. L. Victor Allis: "Searching for Solutions in Games and Artificial Intelligence" PhD Thesis, September 1994, ISBN 90-9007488-0. 79. Martin Schmidt: "Temporal Difference Learning and Chess" Aarhus University, Computer Science Department, Denmark, June 20, 1994. WBR, Ilya.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.