Solutions to 5 problems for Fingering Domain.
For each problem, we show:
- The first solution with SCRs [*]
- The first solution without SCRs
- The best solution (found with SCRs, will be idebtical but LATER without
                     SCRs. Printed only if different from [*])
For analysis see sheet with tables
-------------------------------------------------------------------------------

C-MAJOR
-------
(first solution, with SCRs):

Goal State: (AND (PLAY-NOTE C1 1) (PLAY-NOTE D1 2) (PLAY-NOTE E1 3) (PLAY-NOTE F1 4) (PLAY-NOTE G1 5) (PLAY-NOTE A1 6) (PLAY-NOTE B1 7) (PLAY-NOTE C2 8) (PLAY-NOTE B1 9) (PLAY-NOTE A1 10) (PLAY-NOTE G1 11) (PLAY-NOTE F1 12) (PLAY-NOTE E1 13) (PLAY-NOTE D1 14) (PLAY-NOTE C1 15) (MOST-COST 999))

CPU time: 2.9 seconds
Number of Nodes: 34
Solution Length: 16
Operator Sequence: 

      JUMP-THUMB C1 9 1
      PLAY-NOTE-INDEX D1 10 2
      PLAY-NOTE-MIDDLE E1 11 3
      THUMB-UNDER-MIDDLE F1 13 4
      PLAY-NOTE-INDEX G1 14 5
      PLAY-NOTE-MIDDLE A1 15 6
      PLAY-NOTE-RING B1 16 7
      THUMB-UNDER-RING C2 18 8
      RING-OVER-THUMB B1 20 9
      PLAY-NOTE-MIDDLE A1 21 10
      PLAY-NOTE-INDEX G1 22 11
      PLAY-NOTE-THUMB F1 23 12
      MIDDLE-OVER-THUMB E1 25 13
      PLAY-NOTE-INDEX D1 26 14
      PLAY-NOTE-THUMB C1 27 15
      HURRAY-WE-ARE-DONE

................................
(first solution, without SCRs):

Goal State: (AND (PLAY-NOTE C1 1) (PLAY-NOTE D1 2) (PLAY-NOTE E1 3) (PLAY-NOTE F1 4) (PLAY-NOTE G1 5) (PLAY-NOTE A1 6) (PLAY-NOTE B1 7) (PLAY-NOTE C2 8) (PLAY-NOTE B1 9) (PLAY-NOTE A1 10) (PLAY-NOTE G1 11) (PLAY-NOTE F1 12) (PLAY-NOTE E1 13) (PLAY-NOTE D1 14) (PLAY-NOTE C1 15) (MOST-COST 999))

CPU time: 3.3 seconds
Number of Nodes: 34
Solution Length: 16
Operator Sequence: 

      JUMP-THUMB C1 9 1
      PLAY-NOTE-INDEX D1 10 2
      PLAY-NOTE-MIDDLE E1 11 3
      PLAY-NOTE-RING F1 12 4
      PLAY-NOTE-PINKY G1 13 5
      JUMP-THUMB A1 22 6
      PLAY-NOTE-INDEX B1 23 7
      PLAY-NOTE-MIDDLE C2 24 8
      PLAY-NOTE-INDEX B1 25 9
      PLAY-NOTE-THUMB A1 26 10
      INDEX-OVER-THUMB G1 28 11
      PLAY-NOTE-THUMB F1 29 12
      INDEX-OVER-THUMB E1 31 13
      PLAY-NOTE-THUMB D1 32 14
      JUMP-THUMB C1 41 15
      HURRAY-WE-ARE-DONE

................
(best solution):

...............................................................................

2C-MAJOR
--------
(best solution):

(cannot be found within 2500 nodes)

............................
(first solution, with SCRs):

Goal State: (AND (PLAY-NOTE C1 1) (PLAY-NOTE D1 2) (PLAY-NOTE E1 3) (PLAY-NOTE F1 4) (PLAY-NOTE G1 5) (PLAY-NOTE A1 6) (PLAY-NOTE B1 7) (PLAY-NOTE C2 8) (PLAY-NOTE D2 9) (PLAY-NOTE E2 10) (PLAY-NOTE F2 11) (PLAY-NOTE G2 12) (PLAY-NOTE A2 13) (PLAY-NOTE B2 14) (PLAY-NOTE C3 15) (PLAY-NOTE B2 16) (PLAY-NOTE A2 17) (PLAY-NOTE G2 18) (PLAY-NOTE F2 19) (PLAY-NOTE E2 20) (PLAY-NOTE D2 21) (PLAY-NOTE C2 22) (PLAY-NOTE B1 23) (PLAY-NOTE A1 24) (PLAY-NOTE G1 25) (PLAY-NOTE F1 26) (PLAY-NOTE E1 27) (PLAY-NOTE D1 28) (PLAY-NOTE C1 29) (MOST-COST 999))

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

      JUMP-THUMB C1 9 1
      PLAY-NOTE-INDEX D1 10 2
      PLAY-NOTE-MIDDLE E1 11 3
      THUMB-UNDER-MIDDLE F1 13 4
      PLAY-NOTE-INDEX G1 14 5
      PLAY-NOTE-MIDDLE A1 15 6
      PLAY-NOTE-RING B1 16 7
      THUMB-UNDER-RING C2 18 8
      PLAY-NOTE-INDEX D2 19 9
      PLAY-NOTE-MIDDLE E2 20 10
      THUMB-UNDER-MIDDLE F2 22 11
      PLAY-NOTE-INDEX G2 23 12
      PLAY-NOTE-MIDDLE A2 24 13
      PLAY-NOTE-RING B2 25 14
      THUMB-UNDER-RING C3 27 15
      RING-OVER-THUMB B2 29 16
      PLAY-NOTE-MIDDLE A2 30 17
      PLAY-NOTE-INDEX G2 31 18
      PLAY-NOTE-THUMB F2 32 19
      MIDDLE-OVER-THUMB E2 34 20
      PLAY-NOTE-INDEX D2 35 21
      PLAY-NOTE-THUMB C2 36 22
      RING-OVER-THUMB B1 38 23
      PLAY-NOTE-MIDDLE A1 39 24
      PLAY-NOTE-INDEX G1 40 25
      PLAY-NOTE-THUMB F1 41 26
      MIDDLE-OVER-THUMB E1 43 27
      PLAY-NOTE-INDEX D1 44 28
      PLAY-NOTE-THUMB C1 45 29
      HURRAY-WE-ARE-DONE

................................
(first solution, without SCRs):

Goal State: (AND (PLAY-NOTE C1 1) (PLAY-NOTE D1 2) (PLAY-NOTE E1 3) (PLAY-NOTE F1 4) (PLAY-NOTE G1 5) (PLAY-NOTE A1 6) (PLAY-NOTE B1 7) (PLAY-NOTE C2 8) (PLAY-NOTE D2 9) (PLAY-NOTE E2 10) (PLAY-NOTE F2 11) (PLAY-NOTE G2 12) (PLAY-NOTE A2 13) (PLAY-NOTE B2 14) (PLAY-NOTE C3 15) (PLAY-NOTE B2 16) (PLAY-NOTE A2 17) (PLAY-NOTE G2 18) (PLAY-NOTE F2 19) (PLAY-NOTE E2 20) (PLAY-NOTE D2 21) (PLAY-NOTE C2 22) (PLAY-NOTE B1 23) (PLAY-NOTE A1 24) (PLAY-NOTE G1 25) (PLAY-NOTE F1 26) (PLAY-NOTE E1 27) (PLAY-NOTE D1 28) (PLAY-NOTE C1 29) (MOST-COST 999))

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

      JUMP-THUMB C1 9 1
      PLAY-NOTE-INDEX D1 10 2
      PLAY-NOTE-MIDDLE E1 11 3
      PLAY-NOTE-RING F1 12 4
      PLAY-NOTE-PINKY G1 13 5
      JUMP-THUMB A1 22 6
      PLAY-NOTE-INDEX B1 23 7
      PLAY-NOTE-MIDDLE C2 24 8
      PLAY-NOTE-RING D2 25 9
      PLAY-NOTE-PINKY E2 26 10
      JUMP-THUMB F2 35 11
      PLAY-NOTE-INDEX G2 36 12
      PLAY-NOTE-MIDDLE A2 37 13
      PLAY-NOTE-RING B2 38 14
      PLAY-NOTE-PINKY C3 39 15
      PLAY-NOTE-RING B2 40 16
      PLAY-NOTE-MIDDLE A2 41 17
      PLAY-NOTE-INDEX G2 42 18
      PLAY-NOTE-THUMB F2 43 19
      INDEX-OVER-THUMB E2 45 20
      PLAY-NOTE-THUMB D2 46 21
      INDEX-OVER-THUMB C2 48 22
      PLAY-NOTE-THUMB B1 49 23
      INDEX-OVER-THUMB A1 51 24
      PLAY-NOTE-THUMB G1 52 25
      INDEX-OVER-THUMB F1 54 26
      PLAY-NOTE-THUMB E1 55 27
      INDEX-OVER-THUMB D1 57 28
      PLAY-NOTE-THUMB C1 58 29
      HURRAY-WE-ARE-DONE
..............................................................................

HANS
----

(best solution):

CPU time: 15.9 seconds
Number of Nodes: 214
Solution Length: 14
Operator Sequence: 

      JUMP-PINKY C1 9 1
      PLAY-NOTE-MIDDLE E1 10 2
      PLAY-NOTE-MIDDLE E1 11 3
      PLAY-NOTE-RING F1 12 4
      PLAY-NOTE-INDEX D1 13 5
      PLAY-NOTE-INDEX D1 14 6
      PLAY-NOTE-THUMB C1 15 7
      PLAY-NOTE-INDEX D1 16 8
      PLAY-NOTE-MIDDLE E1 17 9
      PLAY-NOTE-RING F1 18 10
      PLAY-NOTE-PINKY G1 19 11
      PLAY-NOTE-PINKY G1 20 12
      PLAY-NOTE-PINKY G1 21 13
      HURRAY-WE-ARE-DONE

............................
(first solution, with SCRs):

Goal State: (AND (PLAY-NOTE G1 1) (PLAY-NOTE E1 2) (PLAY-NOTE E1 3) (PLAY-NOTE F1 4) (PLAY-NOTE D1 5) (PLAY-NOTE D1 6) (PLAY-NOTE C1 7) (PLAY-NOTE D1 8) (PLAY-NOTE E1 9) (PLAY-NOTE F1 10) (PLAY-NOTE G1 11) (PLAY-NOTE G1 12) (PLAY-NOTE G1 13) (MOST-COST 999))

CPU time: 5.7 seconds
Number of Nodes: 30
Solution Length: 14
Operator Sequence: 

      JUMP-PINKY C1 9 1
      PLAY-NOTE-MIDDLE E1 10 2
      PLAY-NOTE-MIDDLE E1 11 3
      THUMB-UNDER-MIDDLE F1 13 4
      JUMP-INDEX D1 22 5
      PLAY-NOTE-INDEX D1 23 6
      PLAY-NOTE-THUMB C1 24 7
      PLAY-NOTE-INDEX D1 25 8
      PLAY-NOTE-MIDDLE E1 26 9
      THUMB-UNDER-MIDDLE F1 28 10
      PLAY-NOTE-INDEX G1 29 11
      PLAY-NOTE-INDEX G1 30 12
      PLAY-NOTE-INDEX G1 31 13
      HURRAY-WE-ARE-DONE

................................
(first solution, without SCRs):

CPU time: 3.1 seconds
Number of Nodes: 30
Solution Length: 14
Operator Sequence: 

      JUMP-THUMB G1 9 1
      JUMP-THUMB E1 18 2
      PLAY-NOTE-THUMB E1 19 3
      PLAY-NOTE-INDEX F1 20 4
      JUMP-THUMB D1 29 5
      PLAY-NOTE-THUMB D1 30 6
      JUMP-THUMB C1 39 7
      PLAY-NOTE-INDEX D1 40 8
      PLAY-NOTE-MIDDLE E1 41 9
      PLAY-NOTE-RING F1 42 10
      PLAY-NOTE-PINKY G1 43 11
      PLAY-NOTE-PINKY G1 44 12
      PLAY-NOTE-PINKY G1 45 13
      HURRAY-WE-ARE-DONE
..............................................................................

SLEEP
-----

(best solution):

CPU time: 60.5 seconds
Number of Nodes: 250
Solution Length: 38
Operator Sequence: 

      JUMP-PINKY F1 9 1
      PLAY-NOTE-RING BF1 10 2
      PLAY-NOTE-INDEX G1 11 3
      PLAY-NOTE-MIDDLE AF1 12 4
      PLAY-NOTE-MIDDLE AF1 13 5
      JUMP-THUMB EF1 22 6
      JUMP-PINKY F1 31 7
      PLAY-NOTE-PINKY C2 32 8
      PLAY-NOTE-RING BF1 33 9
      PLAY-NOTE-INDEX G1 34 10
      PLAY-NOTE-MIDDLE AF1 35 11
      PLAY-NOTE-MIDDLE AF1 36 12
      JUMP-THUMB EF1 45 13
      PLAY-NOTE-PINKY BF1 46 14
      PLAY-NOTE-PINKY BF1 47 15
      PLAY-NOTE-MIDDLE G1 48 16
      PLAY-NOTE-MIDDLE G1 49 17
      JUMP-PINKY F1 58 18
      PLAY-NOTE-PINKY C2 59 19
      PLAY-NOTE-MIDDLE AF1 60 20
      JUMP-THUMB EF1 69 21
      PLAY-NOTE-PINKY BF1 70 22
      PLAY-NOTE-PINKY BF1 71 23
      PLAY-NOTE-MIDDLE G1 72 24
      PLAY-NOTE-MIDDLE G1 73 25
      JUMP-PINKY F1 82 26
      PLAY-NOTE-PINKY C2 83 27
      PLAY-NOTE-MIDDLE AF1 84 28
      PLAY-NOTE-PINKY C2 85 29
      PLAY-NOTE-RING BF1 86 30
      PLAY-NOTE-INDEX G1 87 31
      PLAY-NOTE-MIDDLE AF1 88 32
      JUMP-THUMB EF1 97 33
      JUMP-RING C2 106 34
      PLAY-NOTE-MIDDLE BF1 107 35
      PLAY-NOTE-THUMB G1 108 36
      PLAY-NOTE-INDEX AF1 109 37
      HURRAY-WE-ARE-DONE

............................
(first solution, with SCRs):

Goal State: (AND (PLAY-NOTE C2 1) (PLAY-NOTE BF1 2) (PLAY-NOTE G1 3) (PLAY-NOTE AF1 4) (PLAY-NOTE AF1 5) (PLAY-NOTE EF1 6) (PLAY-NOTE C2 7) (PLAY-NOTE C2 8) (PLAY-NOTE BF1 9) (PLAY-NOTE G1 10) (PLAY-NOTE AF1 11) (PLAY-NOTE AF1 12) (PLAY-NOTE EF1 13) (PLAY-NOTE BF1 14) (PLAY-NOTE BF1 15) (PLAY-NOTE G1 16) (PLAY-NOTE G1 17) (PLAY-NOTE C2 18) (PLAY-NOTE C2 19) (PLAY-NOTE AF1 20) (PLAY-NOTE EF1 21) (PLAY-NOTE BF1 22) (PLAY-NOTE BF1 23) (PLAY-NOTE G1 24) (PLAY-NOTE G1 25) (PLAY-NOTE C2 26) (PLAY-NOTE C2 27) (PLAY-NOTE AF1 28) (PLAY-NOTE C2 29) (PLAY-NOTE BF1 30) (PLAY-NOTE G1 31) (PLAY-NOTE AF1 32) (PLAY-NOTE EF1 33) (PLAY-NOTE C2 34) (PLAY-NOTE BF1 35) (PLAY-NOTE G1 36) (PLAY-NOTE AF1 37) (MOST-COST 999))

CPU time: 31.5 seconds
Number of Nodes: 78
Solution Length: 38
Operator Sequence: 

      JUMP-PINKY F1 9 1
      PLAY-NOTE-RING BF1 10 2
      PLAY-NOTE-INDEX G1 11 3
      PLAY-NOTE-MIDDLE AF1 12 4
      PLAY-NOTE-MIDDLE AF1 13 5
      JUMP-THUMB EF1 22 6
      JUMP-PINKY F1 31 7
      PLAY-NOTE-PINKY C2 32 8
      PLAY-NOTE-RING BF1 33 9
      PLAY-NOTE-INDEX G1 34 10
      PLAY-NOTE-MIDDLE AF1 35 11
      PLAY-NOTE-MIDDLE AF1 36 12
      JUMP-THUMB EF1 45 13
      PLAY-NOTE-PINKY BF1 46 14
      PLAY-NOTE-PINKY BF1 47 15
      PLAY-NOTE-MIDDLE G1 48 16
      PLAY-NOTE-MIDDLE G1 49 17
      JUMP-PINKY F1 58 18
      PLAY-NOTE-PINKY C2 59 19
      PLAY-NOTE-MIDDLE AF1 60 20
      JUMP-THUMB EF1 69 21
      PLAY-NOTE-PINKY BF1 70 22
      PLAY-NOTE-PINKY BF1 71 23
      PLAY-NOTE-MIDDLE G1 72 24
      PLAY-NOTE-MIDDLE G1 73 25
      JUMP-PINKY F1 82 26
      PLAY-NOTE-PINKY C2 83 27
      PLAY-NOTE-MIDDLE AF1 84 28
      PLAY-NOTE-PINKY C2 85 29
      PLAY-NOTE-RING BF1 86 30
      PLAY-NOTE-INDEX G1 87 31
      PLAY-NOTE-MIDDLE AF1 88 32
      JUMP-THUMB EF1 97 33
      JUMP-THUMB C2 106 34
      INDEX-OVER-THUMB BF1 108 35
      JUMP-THUMB G1 117 36
      PLAY-NOTE-INDEX AF1 118 37
      HURRAY-WE-ARE-DONE

................................
(first solution, without SCRs):

Goal State: (AND (PLAY-NOTE C2 1) (PLAY-NOTE BF1 2) (PLAY-NOTE G1 3) (PLAY-NOTE AF1 4) (PLAY-NOTE AF1 5) (PLAY-NOTE EF1 6) (PLAY-NOTE C2 7) (PLAY-NOTE C2 8) (PLAY-NOTE BF1 9) (PLAY-NOTE G1 10) (PLAY-NOTE AF1 11) (PLAY-NOTE AF1 12) (PLAY-NOTE EF1 13) (PLAY-NOTE BF1 14) (PLAY-NOTE BF1 15) (PLAY-NOTE G1 16) (PLAY-NOTE G1 17) (PLAY-NOTE C2 18) (PLAY-NOTE C2 19) (PLAY-NOTE AF1 20) (PLAY-NOTE EF1 21) (PLAY-NOTE BF1 22) (PLAY-NOTE BF1 23) (PLAY-NOTE G1 24) (PLAY-NOTE G1 25) (PLAY-NOTE C2 26) (PLAY-NOTE C2 27) (PLAY-NOTE AF1 28) (PLAY-NOTE C2 29) (PLAY-NOTE BF1 30) (PLAY-NOTE G1 31) (PLAY-NOTE AF1 32) (PLAY-NOTE EF1 33) (PLAY-NOTE C2 34) (PLAY-NOTE BF1 35) (PLAY-NOTE G1 36) (PLAY-NOTE AF1 37) (MOST-COST 999))

CPU time: 10.5 seconds
Number of Nodes: 78
Solution Length: 38
Operator Sequence: 

      JUMP-THUMB C2 9 1
      INDEX-OVER-THUMB BF1 11 2
      JUMP-THUMB G1 20 3
      PLAY-NOTE-INDEX AF1 21 4
      PLAY-NOTE-INDEX AF1 22 5
      JUMP-THUMB EF1 31 6
      JUMP-THUMB C2 40 7
      PLAY-NOTE-THUMB C2 41 8
      INDEX-OVER-THUMB BF1 43 9
      JUMP-THUMB G1 52 10
      PLAY-NOTE-INDEX AF1 53 11
      PLAY-NOTE-INDEX AF1 54 12
      JUMP-THUMB EF1 63 13
      PLAY-NOTE-PINKY BF1 64 14
      PLAY-NOTE-PINKY BF1 65 15
      PLAY-NOTE-MIDDLE G1 66 16
      PLAY-NOTE-MIDDLE G1 67 17
      JUMP-THUMB C2 76 18
      PLAY-NOTE-THUMB C2 77 19
      JUMP-THUMB AF1 86 20
      JUMP-THUMB EF1 95 21
      PLAY-NOTE-PINKY BF1 96 22
      PLAY-NOTE-PINKY BF1 97 23
      PLAY-NOTE-MIDDLE G1 98 24
      PLAY-NOTE-MIDDLE G1 99 25
      JUMP-THUMB C2 108 26
      PLAY-NOTE-THUMB C2 109 27
      JUMP-THUMB AF1 118 28
      PLAY-NOTE-MIDDLE C2 119 29
      PLAY-NOTE-INDEX BF1 120 30
      JUMP-THUMB G1 129 31
      PLAY-NOTE-INDEX AF1 130 32
      JUMP-THUMB EF1 139 33
      JUMP-THUMB C2 148 34
      INDEX-OVER-THUMB BF1 150 35
      JUMP-THUMB G1 159 36
      PLAY-NOTE-INDEX AF1 160 37
      HURRAY-WE-ARE-DONE
..............................................................................

BEETHOVEN
---------
(best solution):

Goal State: (AND (PLAY-NOTE AF1 1) (PLAY-NOTE AF1 2) (PLAY-NOTE DF2 3) (PLAY-NOTE AF1 4) (PLAY-NOTE AF1 5) (PLAY-NOTE F1 6) (PLAY-NOTE DF1 7) (PLAY-NOTE DF1 8) (PLAY-NOTE EF1 9) (PLAY-NOTE DF1 10) (PLAY-NOTE EF1 11) (PLAY-NOTE F1 12) (PLAY-NOTE DF1 13) (PLAY-NOTE AF1 14) (PLAY-NOTE AF1 15) (PLAY-NOTE DF2 16) (PLAY-NOTE AF1 17) (PLAY-NOTE AF1 18) (PLAY-NOTE F1 19) (PLAY-NOTE DF1 20) (PLAY-NOTE DF1 21) (PLAY-NOTE EF1 22) (PLAY-NOTE F1 23) (PLAY-NOTE EF1 24) (PLAY-NOTE DF1 25) (PLAY-NOTE DF1 26) (MOST-COST 74))

CPU time: 35.2 seconds
Number of Nodes: 197
Solution Length: 27
Operator Sequence: 

      JUMP-RING AF1 9 1
      PLAY-NOTE-RING AF1 10 2
      JUMP-PINKY GF1 19 3
      PLAY-NOTE-INDEX AF1 20 4
      PLAY-NOTE-INDEX AF1 21 5
      JUMP-THUMB F1 30 6
      JUMP-THUMB DF1 39 7
      PLAY-NOTE-THUMB DF1 40 8
      PLAY-NOTE-INDEX EF1 41 9
      PLAY-NOTE-THUMB DF1 42 10
      PLAY-NOTE-INDEX EF1 43 11
      PLAY-NOTE-MIDDLE F1 44 12
      PLAY-NOTE-THUMB DF1 45 13
      PLAY-NOTE-PINKY AF1 46 14
      PLAY-NOTE-PINKY AF1 47 15
      JUMP-PINKY GF1 56 16
      PLAY-NOTE-INDEX AF1 57 17
      PLAY-NOTE-INDEX AF1 58 18
      JUMP-MIDDLE F1 67 19
      PLAY-NOTE-THUMB DF1 68 20
      PLAY-NOTE-THUMB DF1 69 21
      PLAY-NOTE-INDEX EF1 70 22
      PLAY-NOTE-MIDDLE F1 71 23
      PLAY-NOTE-INDEX EF1 72 24
      PLAY-NOTE-THUMB DF1 73 25
      PLAY-NOTE-THUMB DF1 74 26
      HURRAY-WE-ARE-DONE

............................
(first solution, with SCRs):

Goal State: (AND (PLAY-NOTE AF1 1) (PLAY-NOTE AF1 2) (PLAY-NOTE DF2 3) (PLAY-NOTE AF1 4) (PLAY-NOTE AF1 5) (PLAY-NOTE F1 6) (PLAY-NOTE DF1 7) (PLAY-NOTE DF1 8) (PLAY-NOTE EF1 9) (PLAY-NOTE DF1 10) (PLAY-NOTE EF1 11) (PLAY-NOTE F1 12) (PLAY-NOTE DF1 13) (PLAY-NOTE AF1 14) (PLAY-NOTE AF1 15) (PLAY-NOTE DF2 16) (PLAY-NOTE AF1 17) (PLAY-NOTE AF1 18) (PLAY-NOTE F1 19) (PLAY-NOTE DF1 20) (PLAY-NOTE DF1 21) (PLAY-NOTE EF1 22) (PLAY-NOTE F1 23) (PLAY-NOTE EF1 24) (PLAY-NOTE DF1 25) (PLAY-NOTE DF1 26) (MOST-COST 999))

CPU time: 19.6 seconds
Number of Nodes: 56
Solution Length: 27
Operator Sequence: 

      JUMP-RING AF1 9 1
      PLAY-NOTE-RING AF1 10 2
      JUMP-PINKY GF1 19 3
      PLAY-NOTE-INDEX AF1 20 4
      PLAY-NOTE-INDEX AF1 21 5
      JUMP-THUMB F1 30 6
      JUMP-THUMB DF1 39 7
      PLAY-NOTE-THUMB DF1 40 8
      PLAY-NOTE-INDEX EF1 41 9
      PLAY-NOTE-THUMB DF1 42 10
      PLAY-NOTE-INDEX EF1 43 11
      PLAY-NOTE-MIDDLE F1 44 12
      PLAY-NOTE-THUMB DF1 45 13
      PLAY-NOTE-PINKY AF1 46 14
      PLAY-NOTE-PINKY AF1 47 15
      JUMP-PINKY GF1 56 16
      PLAY-NOTE-INDEX AF1 57 17
      PLAY-NOTE-INDEX AF1 58 18
      JUMP-INDEX F1 67 19
      JUMP-THUMB DF1 76 20
      PLAY-NOTE-THUMB DF1 77 21
      PLAY-NOTE-INDEX EF1 78 22
      PLAY-NOTE-MIDDLE F1 79 23
      PLAY-NOTE-INDEX EF1 80 24
      PLAY-NOTE-THUMB DF1 81 25
      PLAY-NOTE-THUMB DF1 82 26
      HURRAY-WE-ARE-DONE

................................
(first solution, without SCRs):

Goal State: (AND (PLAY-NOTE AF1 1) (PLAY-NOTE AF1 2) (PLAY-NOTE DF2 3) (PLAY-NOTE AF1 4) (PLAY-NOTE AF1 5) (PLAY-NOTE F1 6) (PLAY-NOTE DF1 7) (PLAY-NOTE DF1 8) (PLAY-NOTE EF1 9) (PLAY-NOTE DF1 10) (PLAY-NOTE EF1 11) (PLAY-NOTE F1 12) (PLAY-NOTE DF1 13) (PLAY-NOTE AF1 14) (PLAY-NOTE AF1 15) (PLAY-NOTE DF2 16) (PLAY-NOTE AF1 17) (PLAY-NOTE AF1 18) (PLAY-NOTE F1 19) (PLAY-NOTE DF1 20) (PLAY-NOTE DF1 21) (PLAY-NOTE EF1 22) (PLAY-NOTE F1 23) (PLAY-NOTE EF1 24) (PLAY-NOTE DF1 25) (PLAY-NOTE DF1 26) (MOST-COST 999))

CPU time: 5.5 seconds
Number of Nodes: 56
Solution Length: 27
Operator Sequence: 

      JUMP-THUMB AF1 9 1
      PLAY-NOTE-THUMB AF1 10 2
      PLAY-NOTE-RING DF2 11 3
      PLAY-NOTE-THUMB AF1 12 4
      PLAY-NOTE-THUMB AF1 13 5
      JUMP-THUMB F1 22 6
      JUMP-THUMB DF1 31 7
      PLAY-NOTE-THUMB DF1 32 8
      PLAY-NOTE-INDEX EF1 33 9
      PLAY-NOTE-THUMB DF1 34 10
      PLAY-NOTE-INDEX EF1 35 11
      PLAY-NOTE-MIDDLE F1 36 12
      PLAY-NOTE-THUMB DF1 37 13
      PLAY-NOTE-PINKY AF1 38 14
      PLAY-NOTE-PINKY AF1 39 15
      JUMP-THUMB DF2 48 16
      JUMP-THUMB AF1 57 17
      PLAY-NOTE-THUMB AF1 58 18
      JUMP-THUMB F1 67 19
      JUMP-THUMB DF1 76 20
      PLAY-NOTE-THUMB DF1 77 21
      PLAY-NOTE-INDEX EF1 78 22
      PLAY-NOTE-MIDDLE F1 79 23
      PLAY-NOTE-INDEX EF1 80 24
      PLAY-NOTE-THUMB DF1 81 25
      PLAY-NOTE-THUMB DF1 82 26
      HURRAY-WE-ARE-DONE

