Abstract
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve “simple” (welldefined and well-structured) problems has dominated algorithm design. Over the same time period, both processing and storage capacity of computers have increased roughly by a factor of 106. The next few decades may well give us a similar rate of growth in raw computing power, due to various factors such as continuing miniaturization, parallel and distributed computing. If a quantitative change of orders of magnitude leads to qualitative changes, where will the latter take place? Many problems exhibit no detectable regular structure to be exploited, they appear “chaotic”, and do not yield to efficient algorithms. Exhaustive search of large state spaces appears to be the only viable approach. We survey techniques for exhaustive search, typical combinatorial problems that have been solved, and present one case study in detail.
Preview
Unable to display preview. Download preview PDF.
References
J. D. Allen, A Note on the Computer Solution of Connect-Four, in: Heuristic Programming in Artificial Intelligence 1: the First Computer Olympiad (eds. D.N.L. Levy and D.F. Beal), Ellis Horwood, Chichester, England. 1989, pp. 134–135.
L.V. Allis, Searching for Solutions in Games and Artificial Intelligence, Doctoral dissertation, University of Limburg, Maastricht, (1994).
K. Appell and W. Haken, The Solution of the Four-Color-Map Problem, Scientific American (Oct. 1977) 108–121.
D. Avis and K. Fukuda, Reverse Search for Enumeration, Report, U. Tsukuba. Discrete Applied Math. (1992) (to appear).
E. Berlekamp, J.H. Conway and R.K. Guy, Winning Ways for your Mathematical Plays, Academic Press, London, 1982.
J. Culberson and J. Schaeffer, Efficiently Searching the 15-Puzzle, internal report, University of Alberta, Edmonton, Canada, 1994.
R. Gasser, Applying Retrograde Analysis to Nine Men's Morris, in: Heuristic Programming in Artificial Intelligence 2: the Second Computer Olympiad (eds. D.N.L. Levy and D.F. Beal), Ellis Horwood, Chichester, England. 1990, pp. 161–173.
R. Gasser, Endgame Database Compression for Humans and Machines, in: Heuristic Programming in Artificial Intelligence 3: the Third Computer Olympiad (eds. H.J. van den Herik and L.V. Allis), Ellis Horwood, Chichester, England. 1990, pp. 180–191.
R. Gasser, J. Nievergelt, Es ist entschieden: Das Muehlespiel ist unentschieden, Informatik Spektrum 17:5 (1994) 314–317.
R. Gasser, Harnessing Computational Resources for Efficient Exhaustive Search, Doctoral dissertation, ETH Zürich, 1995.
R. Gasser, J. Waldvogel, Primes in Intervals of Fixed Length, in preparation (1995).
O. Hansson, A. Mayer and M. Yung, Criticizing Solutions to Relaxed Models Yields Powerful Admissible Heuristics, Information Sciences 63 (1992) 207–227.
H.J. van den Herik and I.S. Herschberg, A Data Base on Data Bases, ICCA Journal 9:1 (1986) 29.
J. Horgan, The Death of Proof, Scientific American (1993) 74–82.
D. E. Knuth and R. W. Moore, An analysis of Alpha-Beta Pruning, Artificial Intelligence 6 (1975) 293–326.
H. Kociemba, Close to God's Algorithm, Cubism for Fun 28 (1992) 10–13.
R.E. Korf, Depth-first Iterative Deepening, An Optimal Admissible Tree Search, Artificial Intelligence 27 (1985) 97–109.
R. Lake, J. Schaeffer and P. Lu, Solving Large Retrograde Analysis Problems Using a Network of Workstations, internal report, University of Alberta, Edmonton, Canada, 1994.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, The Traveling Salesman Problem — A Guided Tour of Combinatorial Optimization, Wiley, 1985.
D. H. Lehmer, The Sieve Problem for All-Purpose Computers, Mathematical Tables and Aids to Computation 7 (1953) 6–14.
D. H. Lehmer, The Machine Tools of Combinatorics, in: E. F. Beckenbach (ed.), Applied Combinatorial Mathematics, Wiley, 1964, Chapter 1, pp. 5–31.
D. Levy, Nine Men's Morris, Heuristic Programming in Artificial Intelligence 2: the Second Computer Olympiad (eds. D.N.L. Levy and D.F. Beal), Ellis Horwood, Chichester, England. 1991, 55–57.
J. Nievergelt, Experiments in Computational Heuristics, and their Lessons for Software and Knowledge Engineering, Advances in Computers, Vol 37 (M. Yovits, ed.), Academic Press. 1993, pp. 167–205.
J. Nievergelt, N. Deo, Metric Graphs Elastically Embeddable in the Plane, Information Processing Letters (1995) (to appear).
J. Nunn, Secrets of Rook Endings 1992, Secrets of Pawnless Endings 1994, Secrets of Minor Piece Endings, to appear 1995, Batsford Ltd. UK.
O. Patashnik, Qubic: 4×4×4 Tic-Tac-Toe, Mathematics Magazine 53:4 (1980) 202–216.
J. Pearl, Heuristics, Addison-Wesley Publ. Comp., Reading, MA, 1984.
I. Pohl, Bi-Directional Search, Machine Intelligence, Vol. 6 (eds. B. Metzler and D. Michie), American Elsevier, New York. 1971, pp. 127–140.
D. Ratner and M. Warmuth, Finding a Shortest Solution for the (N x N)-Extension of the 15-Puzzle is Intractable, J. Symbolic Computation 10 (1990) 111–137.
G. Reinelt, “TSPLIB”, available on the Worldwide Web (WWW), http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html
J. Schaeffer, J. Culberson, N. Treloar, B. Knight, P. Lu and D. Szafron, A World Championship Caliber Checkers Program, Artificial Intelligence 53 (1992) 273–289.
L. Stiller, Group Graphs and Computational Symmetry on Massively Parallel Architecture, The Journal of Supercomputing 5 (1991) 99–117.
T. Stroehlein, Untersuchungen ueber Kombinatorische Spiele, Doctoral thesis, Technische Hochschule München, München, 1970.
B. Sucrow, Algorithmische und Kombinatorische Untersuchungen zum Puzzle von Sam Loyd, Doctoral thesis, University of Essen, 1992.
S. Tay, J. Nievergelt, A Minmax Relationship between Embeddable and Rigid Graphs, in preparation (1995).
K. Thompson, Retrograde Analysis of Certain Endgames, ICCA Journal 9:3 (1986) 131–139.
K. Thompson, Chess Endgames Vol. 1, ICCA Journal 14:1 (1991) 22.
K. Thompson, Chess Endgames Vol. 2, ICCA Journal 15:3 (1992) 149.
J. von Neumann, O. Morgenstern, Theory of Games and Economic Behavior, Princeton Univ. Press, Princeton, NJ, 1953.
M. Wells, Elements of Combinatorial Computing, Pergamon Press, Oxford, 1971.
R.M. Wilson, Graph Puzzles, Homotopy, and the Alternating Group, J. Combinatorial Theory, Series B: 16 (1974) 86–96.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nievergelt, J., Gasser, R., Mäser, F., Wirth, C. (1995). All the needles in a haystack: Can exhaustive search overcome combinatorial chaos?. In: van Leeuwen, J. (eds) Computer Science Today. Lecture Notes in Computer Science, vol 1000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015248
Download citation
DOI: https://doi.org/10.1007/BFb0015248
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60105-0
Online ISBN: 978-3-540-49435-5
eBook Packages: Springer Book Archive