Ariadne's thread (logic): Difference between revisions
fix typo |
copy edited, wikified |
||
Line 1: | Line 1: | ||
{{references}} |
|||
{{cleanupdate|February 2006}} |
|||
⚫ | '''Ariadne's thread''', also known as '''Backtracking''', named after the Greek fable of [[Ariadne]], is the element of any [[deductive logic]] which binds a cohesive system of thought together in an understandable fashion. 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 a desired end position. |
||
==Origins== |
|||
⚫ | When doing a calculation |
||
It is named after the thread used by Theseus, in the Greek fable of [[Ariadne]], to find his way back when he made a wrong turn in the Labyrinth and to escape after he had killed the Minotaur. |
|||
==Examples== |
|||
⚫ | |||
⚫ | When doing a calculation it is sometimes necessary to make a guess and examine the consequences of a hypothetical case. If this does not lead to a positive resolution, it will lead to a contradiction instead. In that case, one must back-track and undo the changes which one made while testing one's guess and then take another route. This requires keeping a record of the changes made in a form which allows them to be reversed. Such a record is called an '''Ariadne's thread'''. [[Wikipedia]]'s "history" is an example of ''Ariadne's thread'' because it can be used to revert changes and thus return to an earlier version of the article. |
||
==Uses== |
|||
Wikipedia's "history" is an example of ''Ariadne's thread'' because it can be used to revert changes and thus return to an earlier version of the article. |
|||
⚫ | Ariadne's thread is used extensively in programs which play chess and make deep searches of the game tree. In this case, one may not reach a contradiction at the end of a branch; rather one brings back information about the value of the branch, when retracing Ariadne's thread, to be used in calculating which move to make. |
||
⚫ | |||
⚫ | |||
⚫ | |||
*[[Ariadne]] |
*[[Ariadne]] |
||
*[[Backtracking]] |
*[[Backtracking]] |
||
Line 16: | Line 18: | ||
*[[Computer chess]] |
*[[Computer chess]] |
||
==References== |
|||
⚫ | |||
==External links== |
|||
[[Category:Logic]] |
[[Category:Logic]] |
||
[[Category:Operations research]] |
[[Category:Operations research]] |
||
⚫ |
Revision as of 03:43, 26 April 2006
Ariadne's thread, also known as Backtracking, named after the Greek fable of Ariadne, is the element of any deductive logic which binds a cohesive system of thought together in an understandable fashion. 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 a desired end position.
Origins
It is named after the thread used by Theseus, in the Greek fable of Ariadne, to find his way back when he made a wrong turn in the Labyrinth and to escape after he had killed the Minotaur.
Examples
When doing a calculation it is sometimes necessary to make a guess and examine the consequences of a hypothetical case. If this does not lead to a positive resolution, it will lead to a contradiction instead. In that case, one must back-track and undo the changes which one made while testing one's guess and then take another route. This requires keeping a record of the changes made in a form which allows them to be reversed. Such a record is called an Ariadne's thread. Wikipedia's "history" is an example of Ariadne's thread because it can be used to revert changes and thus return to an earlier version of the article.
Uses
Ariadne's thread is used extensively in programs which play chess and make deep searches of the game tree. In this case, one may not reach a contradiction at the end of a branch; rather one brings back information about the value of the branch, when retracing Ariadne's thread, to be used in calculating which move to make.