Related Experiment Video
Updated: May 29, 2026

Monitoring Fine and Associative Motor Learning in Mice Using the Erasmus Ladder
Published on: December 15, 2023
An empirical comparison of backtracking algorithms
1Department of Computer Science, Indiana University, Bloomington, IN 47405.
Abstract:
In this paper we report the results of experimental studies of zero-level, one-level, and two-level search rearrangement backtracking. We establish upper and lower limits for the size problem for which one-level backtracking is preferred over zero-level and two-level methods, thereby showing that the zero-level method is best for very small problems. The one-level method is best for moderate size problems, and the two-level method is best for extremely large problems. Together with our theoretical asymptotic formulas, these measurements provide a useful guide for selecting the best search rearrangement method for a particular problem.
Related Concept Videos
Trial and Error and Algorithm
Bootstrapping
Comparing the Survival Analysis of Two or More Groups
Multiple Comparison Tests
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...
Wald-Wolfowitz Runs Test I
The test works...
Comparing Experimental Results: Student's t-Test
