Trial and Error

From Chessprogramming wiki
Jump to: navigation, search

Home * Programming * Algorithms * Trial and Error

Chimpanzee is giving it a try [1]

Trial and Error is a general problem solving method in contrast of an approach using insight and theory. In science, formulation and testing of hypotheses is based on trial and error, in computer science also called generate and test, and in elementary algebra, when solving certain equations, called guess and check. Learning and optimization methods such as genetic algorithms, simulated annealing and reinforcement learning also apply trial and error methods. In general, trial and error makes no attempt to discover why a solution works, but that it is a solution. A further application related to computer chess is to find factors for the application of Magic Bitboards with spare populated, but otherwise randomly chosen numbers.

See also

Selected Publications

External Links

Randy Brecker, Michael Brecker, Barry Rogers, Billy Cobham, John Abercrombie, Edward Vernon, Jeff Kent, Doug Lubahn


  1. Given enough time, a hypothetical monkey typing at random would, as part of its output, almost surely produce all of Shakespeare's plays. In this image a chimpanzee is giving it a try, Infinite monkey theorem from Wikipedia, Wikimedia Commons

Up one Level