Theory and application of back-tracking techniques

<p>High-speed computers can be used to solve many problems that require a large number of tests that satisfy either a positive or a negative requirement. However, the size of the problem that can be handled is limited by the speed and by the accessibility of the computer. Back-tracking is a technique that provides a more efficient method of solving such problems, and thus enables larger problems to he handled.</p> <p>Chapter I introduces the subject of back-tracking, discusses the general back-t:racking algorithm, and illustrates the technique with an elementary problem in Combinatorial Analysis.In Chapter II, the back-track method is used to solve the Queens problem, a problem of much interest to Mathematicians.</p> <p>Chapter III states and proves several theorems that resulted from the application of the back--tracking technique to the Queens problem. In Chapter IV, the method is used to solve several problems on the partitioning of numbers. The author leaves the reader with the following conjecture. "There are no non-cyclic pure Latin squares.'</p>

Name thesis:degree_name

Master of Science (MS) in Mathematics

Level thesis:degree_level

Thesis: EWU Only

Discipline thesis:degree_discipline

Mathematics

Year

1971

Author dc:creator

• Verner, Robert Hamilton

• Discrete Mathematics and Combinatorics
• Other Mathematics

Statement dc:rights

• Access perpetually restricted to EWU users with an active EWU NetID

Repository record dc:identifier

https://dc.ewu.edu/theses/792

OAI identifier oai:identifier

oai:dc.ewu.edu:theses-1790