Related Experiment Video
Updated: Jun 6, 2026

An Appetitive Spatial Working Memory Task for Mice in a Semi-Automated 8-Arm Radial Maze, Reducing Fearful Memory Association in the Maze
Published on: July 29, 2025
MAWA∗-a memory-bounded anytime heuristic-search algorithm
Satya Gautam Vadlamudi1, Sandip Aine, Partha Pratim Chakrabarti
1Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India. satya@cse.iitkgp.ernet.in
Abstract:
This paper presents a heuristic-search algorithm called Memory-bounded Anytime Window A∗ (MAWA∗), which is complete, anytime, and memory bounded. MAWA∗ uses the window-bounded anytime-search methodology of AWA∗ as the basic framework and combines it with the memory-bounded A∗ -like approach to handle restricted memory situations. Simple and efficient versions of MAWA∗ targeted for tree search have also been presented. Experimental results of the sliding-tile puzzle problem and the traveling-salesman problem show the significant advantages of the proposed algorithm over existing methods.
Related Concept Videos
The Availability Heuristic
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Statically Indeterminate Problem Solving
Understanding Memory
Trial and Error and Algorithm