Solutions for new Problems
(contains only the first solution for the problems. In order to know
the best solution length, we would have to use the 'Hack' Domain)

;;;-------------------------------------------------------------- 
'Schumann'
First solution:

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

Goal State: (AND (PLAY-NOTE E1 1) (PLAY-NOTE A1 2) (PLAY-NOTE E1 3) (PLAY-NOTE A1 4) (PLAY-NOTE C2 5) (PLAY-NOTE A1 6) (PLAY-NOTE C2 7) (PLAY-NOTE E2 8) (PLAY-NOTE C2 9) (PLAY-NOTE F2 10) (PLAY-NOTE E2 11) (PLAY-NOTE C2 12) (PLAY-NOTE A1 13) (PLAY-NOTE B1 14) (PLAY-NOTE GS1 15) (PLAY-NOTE C2 16) (PLAY-NOTE B1 17) (PLAY-NOTE GS1 18) (PLAY-NOTE E1 19) (PLAY-NOTE A1 20) (PLAY-NOTE E1 21) (PLAY-NOTE C2 22) (PLAY-NOTE B1 23) (PLAY-NOTE E1 24) (PLAY-NOTE A1 25) (PLAY-NOTE E1 26) (PLAY-NOTE A1 27) (PLAY-NOTE C2 28) (PLAY-NOTE A1 29) (PLAY-NOTE C2 30) (PLAY-NOTE E2 31) (PLAY-NOTE C2 32) (PLAY-NOTE F2 33) (PLAY-NOTE E2 34) (PLAY-NOTE C2 35) (PLAY-NOTE A1 36) (PLAY-NOTE B1 37) (PLAY-NOTE GS1 38) (PLAY-NOTE C2 39) (PLAY-NOTE B1 40) (PLAY-NOTE GS1 41) (PLAY-NOTE E1 42) (PLAY-NOTE E1 43) (PLAY-NOTE E1 44) (PLAY-NOTE GS1 45) (PLAY-NOTE A1 46) (MOST-COST 99999))

CPU time: 40.4 seconds
Number of Nodes: 127
Solution Length: 47
Operator Sequence: 

      JUMP-INDEX E1 9 1
      PLAY-NOTE-PINKY A1 10 2
      PLAY-NOTE-INDEX E1 11 3
      PLAY-NOTE-PINKY A1 12 4
      JUMP-RING C2 21 5
      PLAY-NOTE-INDEX A1 22 6
      PLAY-NOTE-RING C2 23 7
      JUMP-RING E2 32 8
      PLAY-NOTE-INDEX C2 33 9
      PLAY-NOTE-PINKY F2 34 10
      PLAY-NOTE-RING E2 35 11
      PLAY-NOTE-INDEX C2 36 12
      JUMP-INDEX A1 45 13
      PLAY-NOTE-MIDDLE B1 46 14
      PLAY-NOTE-THUMB GS1 47 15
      PLAY-NOTE-RING C2 48 16
      PLAY-NOTE-MIDDLE B1 49 17
      PLAY-NOTE-THUMB GS1 50 18
      JUMP-INDEX E1 59 19
      PLAY-NOTE-PINKY A1 60 20
      PLAY-NOTE-INDEX E1 61 21
      JUMP-PINKY C2 70 22
      PLAY-NOTE-RING B1 71 23
      JUMP-INDEX E1 80 24
      PLAY-NOTE-PINKY A1 81 25
      PLAY-NOTE-INDEX E1 82 26
      PLAY-NOTE-PINKY A1 83 27
      JUMP-RING C2 92 28
      PLAY-NOTE-INDEX A1 93 29
      PLAY-NOTE-RING C2 94 30
      JUMP-RING E2 103 31
      PLAY-NOTE-INDEX C2 104 32
      PLAY-NOTE-PINKY F2 105 33
      PLAY-NOTE-RING E2 106 34
      PLAY-NOTE-INDEX C2 107 35
      JUMP-INDEX A1 116 36
      PLAY-NOTE-MIDDLE B1 117 37
      PLAY-NOTE-THUMB GS1 118 38
      PLAY-NOTE-RING C2 119 39
      PLAY-NOTE-MIDDLE B1 120 40
      PLAY-NOTE-THUMB GS1 121 41
      JUMP-INDEX E1 130 42
      PLAY-NOTE-INDEX E1 131 43
      PLAY-NOTE-INDEX E1 132 44
      PLAY-NOTE-RING GS1 133 45
      PLAY-NOTE-PINKY A1 134 46
      HURRAY-WE-ARE-DONE

;;;-------------------------------------------------------------- 
'French'
First solution:
* * * * * P R O D I G Y 2.11 * * * * *

Goal State: (AND (PLAY-NOTE G1 1) (PLAY-NOTE D2 2) (PLAY-NOTE D2 3) (PLAY-NOTE D2 4) (PLAY-NOTE D2 5) (PLAY-NOTE D2 6) (PLAY-NOTE EF2 7) (PLAY-NOTE D2 8) (PLAY-NOTE C2 9) (PLAY-NOTE BF1 10) (PLAY-NOTE A1 11) (PLAY-NOTE BF1 12) (PLAY-NOTE G1 13) (PLAY-NOTE G1 14) (PLAY-NOTE D2 15) (PLAY-NOTE D2 16) (PLAY-NOTE D2 17) (PLAY-NOTE D2 18) (PLAY-NOTE D2 19) (PLAY-NOTE EF2 20) (PLAY-NOTE D2 21) (PLAY-NOTE C2 22) (PLAY-NOTE BF1 23) (PLAY-NOTE A1 24) (PLAY-NOTE G1 25) (MOST-COST 99999))

CPU time: 7.3 seconds
Number of Nodes: 76


(FAILURE ! See comments in B6) )
;;;-------------------------------------------------------------- 
'Tune'
First solution:

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

Goal State: (AND (PLAY-NOTE D2 1) (PLAY-NOTE D2 2) (PLAY-NOTE E2 3) (PLAY-NOTE D2 4) (PLAY-NOTE B1 5) (PLAY-NOTE CS2 6) (PLAY-NOTE AS1 7) (PLAY-NOTE E2 8) (PLAY-NOTE CS2 9) (PLAY-NOTE D2 10) (PLAY-NOTE E2 11) (PLAY-NOTE CS2 12) (PLAY-NOTE D2 13) (PLAY-NOTE B1 14) (PLAY-NOTE D2 15) (PLAY-NOTE D2 16) (PLAY-NOTE E2 17) (PLAY-NOTE D2 18) (PLAY-NOTE B1 19) (PLAY-NOTE CS2 20) (PLAY-NOTE AS1 21) (PLAY-NOTE FS1 22) (PLAY-NOTE AS1 23) (PLAY-NOTE B1 24) (PLAY-NOTE CS2 25) (PLAY-NOTE AS1 26) (PLAY-NOTE B1 27) (MOST-COST 99999))

CPU time: 11.4 seconds
Number of Nodes: 58
Solution Length: 28
Operator Sequence: 

      JUMP-RING D2 9 1
      PLAY-NOTE-RING D2 10 2
      PLAY-NOTE-PINKY E2 11 3
      PLAY-NOTE-RING D2 12 4
      PLAY-NOTE-INDEX B1 13 5
      PLAY-NOTE-MIDDLE CS2 14 6
      PLAY-NOTE-THUMB AS1 15 7
      PLAY-NOTE-PINKY E2 16 8
      PLAY-NOTE-MIDDLE CS2 17 9
      PLAY-NOTE-RING D2 18 10
      PLAY-NOTE-PINKY E2 19 11
      PLAY-NOTE-MIDDLE CS2 20 12
      PLAY-NOTE-RING D2 21 13
      PLAY-NOTE-INDEX B1 22 14
      PLAY-NOTE-RING D2 23 15
      PLAY-NOTE-RING D2 24 16
      PLAY-NOTE-PINKY E2 25 17
      PLAY-NOTE-RING D2 26 18
      PLAY-NOTE-INDEX B1 27 19
      PLAY-NOTE-MIDDLE CS2 28 20
      PLAY-NOTE-THUMB AS1 29 21
      JUMP-THUMB FS1 38 22
      PLAY-NOTE-MIDDLE AS1 39 23
      PLAY-NOTE-RING B1 40 24
      PLAY-NOTE-PINKY CS2 41 25
      PLAY-NOTE-MIDDLE AS1 42 26
      PLAY-NOTE-RING B1 43 27
      HURRAY-WE-ARE-DONE

;;;-------------------------------------------------------------- 
'Skip'
First solution:

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

Goal State: (AND (PLAY-NOTE A1 1) (PLAY-NOTE FS1 2) (PLAY-NOTE D1 3) (PLAY-NOTE FS1 4) (PLAY-NOTE A1 5) (PLAY-NOTE FS1 6) (PLAY-NOTE D1 7) (PLAY-NOTE FS1 8) (PLAY-NOTE G1 9) (PLAY-NOTE E1 10) (PLAY-NOTE CS1 11) (PLAY-NOTE E1 12) (PLAY-NOTE D1 13) (PLAY-NOTE FS1 14) (PLAY-NOTE A1 15) (PLAY-NOTE A1 16) (PLAY-NOTE FS1 17) (PLAY-NOTE D1 18) (PLAY-NOTE FS1 19) (PLAY-NOTE A1 20) (PLAY-NOTE FS1 21) (PLAY-NOTE D1 22) (PLAY-NOTE FS1 23) (PLAY-NOTE G1 24) (PLAY-NOTE E1 25) (PLAY-NOTE CS1 26) (PLAY-NOTE E1 27) (PLAY-NOTE D1 28) (PLAY-NOTE D1 29) (MOST-COST 99999))

CPU time: 14.0 seconds
Number of Nodes: 62
Solution Length: 30
Operator Sequence: 

      JUMP-PINKY A1 9 1
      PLAY-NOTE-MIDDLE FS1 10 2
      PLAY-NOTE-THUMB D1 11 3
      PLAY-NOTE-MIDDLE FS1 12 4
      PLAY-NOTE-PINKY A1 13 5
      PLAY-NOTE-MIDDLE FS1 14 6
      PLAY-NOTE-THUMB D1 15 7
      PLAY-NOTE-MIDDLE FS1 16 8
      PLAY-NOTE-RING G1 17 9
      PLAY-NOTE-INDEX E1 18 10
      JUMP-THUMB CS1 27 11
      PLAY-NOTE-MIDDLE E1 28 12
      PLAY-NOTE-INDEX D1 29 13
      PLAY-NOTE-RING FS1 30 14
      JUMP-PINKY A1 39 15
      PLAY-NOTE-PINKY A1 40 16
      PLAY-NOTE-MIDDLE FS1 41 17
      PLAY-NOTE-THUMB D1 42 18
      PLAY-NOTE-MIDDLE FS1 43 19
      PLAY-NOTE-PINKY A1 44 20
      PLAY-NOTE-MIDDLE FS1 45 21
      PLAY-NOTE-THUMB D1 46 22
      PLAY-NOTE-MIDDLE FS1 47 23
      PLAY-NOTE-RING G1 48 24
      PLAY-NOTE-INDEX E1 49 25
      JUMP-THUMB CS1 58 26
      PLAY-NOTE-MIDDLE E1 59 27
      PLAY-NOTE-INDEX D1 60 28
      PLAY-NOTE-INDEX D1 61 29
      HURRAY-WE-ARE-DONE

;;;-------------------------------------------------------------- 
'Jewish'
First solution:

* * * * * 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))

CPU time: 12.6 seconds
Number of Nodes: 52
Solution Length: 25
Operator Sequence: 

      JUMP-PINKY C2 9 1
      PLAY-NOTE-INDEX G1 10 2
      PLAY-NOTE-PINKY C2 11 3
      PLAY-NOTE-PINKY C2 12 4
      PLAY-NOTE-INDEX G1 13 5
      PLAY-NOTE-PINKY C2 14 6
      PLAY-NOTE-RING B1 15 7
      JUMP-INDEX D2 24 8
      PLAY-NOTE-INDEX D2 25 9
      PLAY-NOTE-RING F2 26 10
      PLAY-NOTE-MIDDLE EF2 27 11
      PLAY-NOTE-MIDDLE EF2 28 12
      PLAY-NOTE-THUMB C2 29 13
      JUMP-INDEX G1 38 14
      PLAY-NOTE-PINKY C2 39 15
      PLAY-NOTE-PINKY C2 40 16
      PLAY-NOTE-INDEX G1 41 17
      JUMP-INDEX D2 50 18
      PLAY-NOTE-PINKY G2 51 19
      PLAY-NOTE-RING F2 52 20
      PLAY-NOTE-MIDDLE EF2 53 21
      PLAY-NOTE-INDEX D2 54 22
      PLAY-NOTE-THUMB C2 55 23
      PLAY-NOTE-THUMB C2 56 24
      HURRAY-WE-ARE-DONE

