Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Chapter 3 - Modern Research on the Human Ability to Solve Problems that Have Large Search Spaces

  • Zygmunt Pizlo, University of California, Irvine
  • Book:
    Problem Solving
    Published online:
    23 June 2022
    Print publication:
    07 July 2022, pp 34-56

  • Summary

    This chapter discusses the traveling salesman problem (TSP), which is the best-known problem with a large search space. TSPs with a moderate number of cities are solved very well by human subjects within a couple of minutes despite the fact that the number of possible tours can be equal to the number of seconds since the Big Bang. Randomly generated tours are much worse than the tours that humans produce. This means that human subjects must have an uncanny ability to navigate very intelligently through enormous spaces without considering too many, if any, alternatives. The absence of search in human problem solving is arguably the biggest difference between artificial intelligence, as it is designed today, and human intelligence, which is obviously the natural Intelligence. Human performance is described and compared to several heuristic algorithms such as the nearest neighbor, convex hull, and hierarchical pyramids. The chapter ends with a description of the performance of young children who solve TSP nearly as well as their parents.