                                     (B5)
                                     ----

Output of 'Hack' domain for Problem 'Jewish':


* * * * * P R O D I G Y 2.11 * * * * *

Goal State: (AND (PLAY-NOTE C2 1) (PLAY-NOTE G1 2) (PLAY-NOTE C2 3) (PLAY-NOTE C2 4) (PLAY-NOTE G1 5) (PLAY-NOTE C2 6) (PLAY-NOTE B1 7) (PLAY-NOTE D2 8) (PLAY-NOTE D2 9) (PLAY-NOTE F2 10) (PLAY-NOTE EF2 11) (PLAY-NOTE EF2 12) (PLAY-NOTE C2 13) (PLAY-NOTE G1 14) (PLAY-NOTE C2 15) (PLAY-NOTE C2 16) (PLAY-NOTE G1 17) (PLAY-NOTE D2 18) (PLAY-NOTE G2 19) (PLAY-NOTE F2 20) (PLAY-NOTE EF2 21) (PLAY-NOTE D2 22) (PLAY-NOTE C2 23) (PLAY-NOTE C2 24) (MOST-COST 99999))
solutions so far: ((1 56))
solutions so far: ((1 56) (1 58))
solutions so far: ((1 56) (2 58))
solutions so far: ((1 56) (3 58))
solutions so far: ((1 56) (3 58) (1 59))
solutions so far: ((1 56) (3 58) (2 59))
solutions so far: ((1 56) (3 58) (3 59))
solutions so far: ((1 56) (3 58) (4 59))
------------------------------ CUTOFF
--- note how the domain prints out a list of solutions found so far after
--- each solution it is finding
------------------------------ back to output, last line only

solutions so far: ((1 56) (11 58) (20 59) (24 60) (8 61) (3 57) (2 64) (36 66)
 (37 67) (23 68) (6 69) (15 65))

*PRODIGY-TIME-BOUND* exceeded!

CPU time: 300.1 seconds
Number of Nodes: 2,265

------------------------------- end output
for the output format of the hack-domain see README-DOC, 7.
note that the domains has come up with the best solution (until time bound
at least) FIRST. The list keeps in the order of solutions found.






