This article was published for ULTIMATE members, available by subscription. You can join here in a minute or less. If you're already a member, log-in from the top right menu.

Ultimate Teaser

Brute Classical Planner: Memory Efficient Forward-Chaining (By Eric Jacopin)

Alex J. Champandard on March 2, 2014

This source code release by Eric Jacopin contains a memory-efficient implementation of a forward-chaining planner. Contrary to many modern planners, uses a very strict memory policy for its runtime search, and its data-structures are designed to be very lean. This makes it faster than many research planners for some problems, emphasizes the need for sensible memory allocation, and is particularly interesting for game developers.