Trial and error

Last updated

Trial and error is a fundamental method of problem-solving. [1] It is characterized by repeated, varied attempts which are continued until success, [2] or until the practicer stops trying.

Contents

According to W.H. Thorpe, the term was devised by C. Lloyd Morgan (1852–1936) after trying out similar phrases "trial and failure" and "trial and practice". [3] Under Morgan's Canon, animal behaviour should be explained in the simplest possible way. Where behavior seems to imply higher mental processes, it might be explained by trial-and-error learning. An example is a skillful way in which his terrier Tony opened the garden gate, easily misunderstood as an insightful act by someone seeing the final behavior. Lloyd Morgan, however, had watched and recorded the series of approximations by which the dog had gradually learned the response, and could demonstrate that no insight was required to explain it.

Edward Lee Thorndike was the initiator of the theory of trial and error learning based on the findings he showed how to manage a trial-and-error experiment in the laboratory. In his famous experiment, a cat was placed in a series of puzzle boxes in order to study the law of effect in learning. [4] He plotted to learn curves which recorded the timing for each trial. Thorndike's key observation was that learning was promoted by positive results, which was later refined and extended by B. F. Skinner's operant conditioning.

Trial and error is also a heuristic method of problem solving, repair, tuning, or obtaining knowledge. In the field of computer science, the method is called generate and test (Brute force). In elementary algebra, when solving equations, it is guess and check.

This approach can be seen as one of the two basic approaches to problem-solving, contrasted with an approach using insight and theory. However, there are intermediate methods which for example, use theory to guide the method, an approach known as guided empiricism.

This way of thinking has become a mainstay of Karl Popper's falsificationist methodology in philosophy of science.

Methodology

The trial and error approach is used most successfully with simple problems and in games, and it is often the last resort when no apparent rule applies. This does not mean that the approach is inherently careless, for an individual can be methodical in manipulating the variables in an attempt to sort through possibilities that could result in success. Nevertheless, this method is often used by people who have little knowledge in the problem area. The trial-and-error approach has been studied from its natural computational point of view [5]

Simplest applications

Ashby (1960, section 11/5) offers three simple strategies for dealing with the same basic exercise-problem, which have very different efficiencies. Suppose a collection of 1000 on/off switches have to be set to a particular combination by random-based testing, where each test is expected to take one second. [This is also discussed in Traill (1978/2006, section C1.2]. The strategies are:

Note the tacit assumption here that no intelligence or insight is brought to bear on the problem. However, the existence of different available strategies allows us to consider a separate ("superior") domain of processing — a "meta-level" above the mechanics of switch handling — where the various available strategies can be randomly chosen. Once again this is "trial and error", but of a different type.

Hierarchies

Ashby's book develops this "meta-level" idea, and extends it into a whole recursive sequence of levels, successively above each other in a systematic hierarchy. On this basis, he argues that human intelligence emerges from such organization: relying heavily on trial-and-error (at least initially at each new stage), but emerging with what we would call "intelligence" at the end of it all. Thus presumably the topmost level of the hierarchy (at any stage) will still depend on simple trial-and-error.

Traill (1978/2006) suggests that this Ashby-hierarchy probably coincides with Piaget's well-known theory of developmental stages. [This work also discusses Ashby's 1000-switch example; see §C1.2]. After all, it is part of Piagetian doctrine that children learn by first actively doing in a more-or-less random way, and then hopefully learn from the consequences — which all has a certain to Ashby's random "trial-and-error".

Application

Traill (2008, espec. Table "S" on p.31) follows Jerne and Popper in seeing this strategy as probably underlying all knowledge-gathering systems — at least in their initial phase.

Four such systems are identified:

Intention

In the Ashby-and-Cybernetics tradition, the word "trial" usually implies random-or-arbitrary, without any deliberate choice.[ citation needed ]

Among non-cyberneticians, however, "trial" will often imply a deliberate subjective act by some adult human agent (e.g., in a court-room, or laboratory), which has sometimes led to confusion.[ citation needed ]

Of course the situation becomes even more confusing if one accepts Ashby's hierarchical explanation of intelligence, and its implied ability to be deliberate and to creatively design — all based ultimately on non-deliberate actions. The lesson here seems to be that one must simply be careful to clarify the meaning of one's own words, and indeed the words of others. [Incidentally it seems that consciousness is not an essential ingredient for intelligence as discussed.[ citation needed ]

One of the greatest inventors with 1093 patents was Thomas Alva Edison (TAE). One of his most famous sayings is usually quoted as: "Genius is 5% inspiration and 95% perspiration."[ citation needed ] Edison and his assistants would try, for example, 500 ways to invent something and when not successful, they would try another 500 ways. When an experiment was not successful, he was happy to admit that he now knew the things that did not work. Trial and error were Edison's most successful means of the invention. Most[ who? ] today believe Edison did not follow a scientific theory to invent but invented by Trial And Error (TAE).[ citation needed ]

Today, the approach of voodoo programming is a usage where code is composed of trial and error until something which produces the desired output is found.[ citation needed ]

Features

Trial and error has a number of features:

It is possible to use trial and error to find all solutions or the best solution, when a testably finite number of possible solutions exist. To find all solutions, one simply makes a note and continues, rather than ending the process, when a solution is found, until all solutions have been tried. To find the best solution, one finds all solutions by the method just described and then comparatively evaluates them based upon some predefined set of criteria, the existence of which is a condition for the possibility of finding a best solution. (Also, when only one solution can exist, as in assembling a jigsaw puzzle, then any solution found is the only solution and so is necessarily the best.)

Examples

Trial and error has traditionally been the main method of finding new drugs, such as antibiotics. Chemists simply try chemicals at random until they find one with the desired effect. In a more sophisticated version, chemists select a narrow range of chemicals it is thought may have some effect using a technique called structure-activity relationship. (The latter case can be alternatively considered as a changing of the problem rather than of the solution strategy: instead of "What chemical will work well as an antibiotic?" the problem in the sophisticated approach is "Which, if any, of the chemicals in this narrow range will work well as an antibiotic?") The method is used widely in many disciplines, such as polymer technology to find new polymer types or families.

Trial and error is also commonly seen in player responses to video games - when faced with an obstacle or boss, players often form a number of strategies to surpass the obstacle or defeat the boss, with each strategy being carried out before the player either succeeds or quits the game.

Sports teams also make use of trial and error to qualify for and/or progress through the playoffs and win the championship, attempting different strategies, plays, lineups and formations in hopes of defeating each and every opponent along the way to victory. This is especially crucial in playoff series in which multiple wins are required to advance, where a team that loses a game will have the opportunity to try new tactics to find a way to win, if they are not eliminated yet.

The scientific method can be regarded as containing an element of trial and error in its formulation and testing of hypotheses. Also compare genetic algorithms, simulated annealing and reinforcement learning – all varieties for search which apply the basic idea of trial and error.

Biological evolution can be considered as a form of trial and error. [6] Random mutations and sexual genetic variations can be viewed as trials and poor reproductive fitness, or lack of improved fitness, as the error. Thus after a long time 'knowledge' of well-adapted genomes accumulates simply by virtue of them being able to reproduce.

Bogosort, a conceptual sorting algorithm (that is extremely inefficient and impractical), can be viewed as a trial and error approach to sorting a list. However, typical simple examples of bogosort do not track which orders of the list have been tried and may try the same order any number of times, which violates one of the basic principles of trial and error. Trial and error is actually more efficient and practical than bogosort; unlike bogosort, it is guaranteed to halt in finite time on a finite list, and might even be a reasonable way to sort extremely short lists under some conditions.

Jumping spiders of the genus Portia use trial and error to find new tactics against unfamiliar prey or in unusual situations, and remember the new tactics. [7] Tests show that Portia fimbriata and Portia labiata can use trial and error in an artificial environment, where the spider's objective is to cross a miniature lagoon that is too wide for a simple jump, and must either jump then swim or only swim. [8] [9]

See also

Related Research Articles

In computer science, artificial intelligence (AI), sometimes called machine intelligence, is intelligence demonstrated by machines, in contrast to the natural intelligence displayed by humans and animals. Leading AI textbooks define the field as the study of "intelligent agents": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals. Colloquially, the term "artificial intelligence" is often used to describe machines that mimic "cognitive" functions that humans associate with the human mind, such as "learning" and "problem solving".

Genetic algorithm competitive algorithm for searching a problem space

In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection. John Holland introduced genetic algorithms in 1960 based on the concept of Darwin’s theory of evolution; his student David E. Goldberg further extended GA in 1989.

Reinforcement learning field of machine learning

Reinforcement learning (RL) is an area of machine learning concerned with how software agents ought to take actions in an environment in order to maximize the notion of cumulative reward. Reinforcement learning is one of three basic machine learning paradigms, alongside supervised learning and unsupervised learning.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement.

Case-based reasoning (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems. An auto mechanic who fixes an engine by recalling another car that exhibited similar symptoms is using case-based reasoning. A lawyer who advocates a particular outcome in a trial based on legal precedents or a judge who creates case law is using case-based reasoning. So, too, an engineer copying working elements of nature, is treating nature as a database of solutions to problems. Case-based reasoning is a prominent type of analogy solution making.

Knowledge is a familiarity, awareness, or understanding of someone or something, such as facts, information, descriptions, or skills, which is acquired through experience or education by perceiving, discovering, or learning.

Procedural knowledge, also known as imperative knowledge, is the knowledge exercised in the performance of some task. See below for the specific meaning of this term in cognitive psychology and intellectual property law.

A cognitive tutor is a particular kind of intelligent tutoring system that utilizes a cognitive model to provide feedback to students as they are working through problems. This feedback will immediately inform students of the correctness, or incorrectness, of their actions in the tutor interface; however, cognitive tutors also have the ability to provide context-sensitive hints and instruction to guide students towards reasonable next steps.

In physics and mathematics, an ansatz is an educated guess or an additional assumption made to help solve a problem, and which is later verified to be part of the solution by its results.

Problem solving consists of using generic or ad hoc methods in an orderly manner to find solutions to problems. Some of the problem-solving techniques developed and used in philosophy, artificial intelligence, computer science, engineering, mathematics, or medicine are related to mental problem-solving techniques studied in psychology.

<i>Portia</i> (spider) genus of arachnids

Portia is a genus of jumping spider that feeds on other spiders. They are remarkable for their intelligent hunting behaviour, which suggests that they are capable of learning and problem solving, traits normally attributed to much larger animals.

Meta-epistemology is a metaphilosophical study of the subject, matter, methods and aims of epistemology and of approaches to understanding and structuring our knowledge of knowledge itself.

Intelligence amplification automation of insight-finding by incorporating natural language processing and machine learning to create better data.

Intelligence amplification (IA) refers to the effective use of information technology in augmenting human intelligence. The idea was first proposed in the 1950s and 1960s by cybernetics and early computer pioneers.

Ariadne's thread, named for the legend of Ariadne, is solving a problem by multiple means - such as a physical maze, a logic puzzle, or an ethical dilemma - through an exhaustive application of logic to all available routes. It is the particular method used that is able to follow completely through to trace steps or take point by point a series of found truths in a contingent, ordered search that reaches an end position. This process can take the form of a mental record, a physical marking, or even a philosophical debate; it is the process itself that assumes the name.

<i>Portia labiata</i> species of arachnid

Portia labiata is a jumping spider found in Sri Lanka, India, southern China, Burma (Myanmar), Malaysia, Singapore, Java, Sumatra and the Philippines. In this medium-sized jumping spider, the front part is orange-brown and the back part is brownish. The conspicuous main eyes provide vision more acute than a cat's during the day and 10 times more acute than a dragonfly's, and this is essential in P. labiata′s navigation, hunting and mating.

Outline of thought Overview of and topical guide to thought

The following outline is provided as an overview of and topical guide to thought (thinking):

In computer science, artificial intelligence, and mathematical optimization, a heuristic is a technique designed for solving a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut.

A hyper-heuristic is a heuristic search method that seeks to automate, often by the incorporation of machine learning techniques, the process of selecting, combining, generating or adapting several simpler heuristics to efficiently solve computational search problems. One of the motivations for studying hyper-heuristics is to build systems which can handle classes of problems rather than solving just one problem.

Simulation-based optimization

Simulation-based optimization integrates optimization techniques into simulation analysis. Because of the complexity of the simulation, the objective function may become difficult and expensive to evaluate.

This glossary of artificial intelligence is a list of definitions of terms and concepts relevant to the study of artificial intelligence, its sub-disciplines, and related fields. Related glossaries include Glossary of computer science, Glossary of robotics, and Glossary of machine vision.

References

  1. Evolutionary Epistemology, Rationality, and the Sociology of Knowledge p94 p108
  2. Concise Oxford Dictionary p1489
  3. Thorpe W.H. The origins and rise of ethology. Hutchinson, London & Praeger, New York. p26. ISBN   978-0-03-053251-1
  4. Thorndike E.L. 1898. Animal intelligence: an experimental study of the association processes in animals. Psychological Monographs #8.
  5. X. Bei, N. Chen, S. Zhang, On the Complexity of Trial and Error, STOC 2013
  6. Wright, Serwall (1932). "The roles of mutation, inbreeding, crossbreeding and selection in evolution" (PDF). Proceedings of the Sixth International Congress on Genetics. Volume 1. Number 6: 365. Retrieved 17 March 2014.
  7. Harland, D.P. & Jackson, R.R. (2000). ""Eight-legged cats" and how they see - a review of recent research on jumping spiders (Araneae: Salticidae)" (PDF). Cimbebasia. 16: 231–240. Archived from the original (PDF) on 28 September 2006. Retrieved 5 May 2011.
  8. Jackson, Robert R.; Fiona R. Cross; Chris M. Carter (2006). "Geographic Variation in a Spider's Ability to Solve a Confinement Problem by Trial and Error". International Journal of Comparative Psychology. 19: 282–296. Retrieved 8 June 2011.
  9. Jackson, Robert R.; Chris M. Carter; Michael S. Tarsitano (2001). "Trial-and-error solving of a confinement problem by a jumping spider, Portia fimbriata". Behaviour. Leiden: Koninklijke Brill. 138 (10): 1215–1234. doi:10.1163/15685390152822184. ISSN   0005-7959. JSTOR   4535886.

Further reading