Freecell is the famous card game taken from the
MS-Windows 98 distribution. The domain was initially introduced in the Aips-00 competition and proved one of
the most difficult domains. Figure 18 presents the performance results in this
domain. Note that Altalt could
not solve these problems and this was also the case in the competition.
In the freecell domain, the only
planners that succeeded to solve some of the difficult problems were Grt and Ff. Actually, these planners solved some problems with 12 and
13 cards per suit. Hsp-2 solved
problems with up to 6 cards per suit and Stan
up to 3 cards per suit. Regarding the solution quality, Grt produced better plans than Ff. Regarding the solution time, Ff was faster in the small problems, whereas in the big ones
the two planners had equal performance.
Figure 18: Solution length and time
(msecs) in the freecell domain.
Ioannis
Refanidis
14-8-2001