
***** FUNCTIONS TRACING MESSAGES:
BESTROUTE.bestroute() - START

param 5 6 0 0 2

OBJECT.isaccessible() - START - input S (int 83)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input X (int 88)

OBJECT.isaccessible() - 'returns' FALSE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input D (int 68)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input X (int 88)

OBJECT.isaccessible() - 'returns' FALSE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input X (int 88)

OBJECT.isaccessible() - 'returns' FALSE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input . (int 46)

OBJECT.isaccessible() - 'returns' TRUE- END

OBJECT.isaccessible() - START - input D (int 68)

OBJECT.isaccessible() - 'returns' TRUE- END

While at 0 of (1)

node 0 0 -1

DX =schemaData.gameMap[0][1] = . (int 46)
DW =schemaData.gameMap[1][0] = . (int 46)
Updates neighbours at iteration 0: 2

While at 1 of (3)

node 0 1 0

SX =schemaData.gameMap[0][0] = S (int 83)
DW =schemaData.gameMap[1][1] = . (int 46)
Updates neighbours at iteration 1: 4

While at 2 of (5)

node 1 0 0

DW =schemaData.gameMap[2][0] = . (int 46)
Updates neighbours at iteration 2: 5

While at 3 of (6)

node 0 0 1

Updates neighbours at iteration 3: 5

While at 4 of (6)

node 1 1 1

DW =schemaData.gameMap[2][1] = . (int 46)
Updates neighbours at iteration 4: 6

While at 5 of (7)

node 2 0 2

DW =schemaData.gameMap[3][0] = . (int 46)
Updates neighbours at iteration 5: 7

While at 6 of (8)

node 2 1 4

DW =schemaData.gameMap[3][1] = . (int 46)
Updates neighbours at iteration 6: 8

While at 7 of (9)

node 3 0 5

DW =schemaData.gameMap[4][0] = . (int 46)
Updates neighbours at iteration 7: 9

While at 8 of (10)

node 3 1 6

DX =schemaData.gameMap[3][2] = . (int 46)
DW =schemaData.gameMap[4][1] = . (int 46)
Updates neighbours at iteration 8: 11

While at 9 of (12)

node 4 0 7

Updates neighbours at iteration 9: 11

While at 10 of (12)

node 3 2 8

DX =schemaData.gameMap[3][3] = . (int 46)
DW =schemaData.gameMap[4][2] = . (int 46)
Updates neighbours at iteration 10: 13

While at 11 of (14)

node 4 1 8

Updates neighbours at iteration 11: 13

While at 12 of (14)

node 3 3 10

UP =schemaData.gameMap[2][3] = . (int 46)
DX =schemaData.gameMap[3][4] = . (int 46)
DW =schemaData.gameMap[4][3] = . (int 46)
Updates neighbours at iteration 12: 16

While at 13 of (17)

node 4 2 10

Updates neighbours at iteration 13: 16

While at 14 of (17)

node 2 3 12

UP =schemaData.gameMap[1][3] = . (int 46)
DX =schemaData.gameMap[2][4] = . (int 46)
Updates neighbours at iteration 14: 18

While at 15 of (19)

node 3 4 12

DX =schemaData.gameMap[3][5] = . (int 46)
DW =schemaData.gameMap[4][4] = . (int 46)
Updates neighbours at iteration 15: 20

While at 16 of (21)

node 4 3 12

Updates neighbours at iteration 16: 20

While at 17 of (21)

node 1 3 14

UP =schemaData.gameMap[0][3] = . (int 46)
DX =schemaData.gameMap[1][4] = . (int 46)
Updates neighbours at iteration 17: 22

While at 18 of (23)

node 2 4 14

DX =schemaData.gameMap[2][5] = . (int 46)
Updates neighbours at iteration 18: 23

While at 19 of (24)

node 3 5 15

DW =schemaData.gameMap[4][5] = D (int 68)
Updates neighbours at iteration 19: 24

While at 20 of (25)

node 4 4 15

Updates neighbours at iteration 20: 24

While at 21 of (25)

node 0 3 17

DX =schemaData.gameMap[0][4] = . (int 46)
Updates neighbours at iteration 21: 25

While at 22 of (26)

node 1 4 17

DX =schemaData.gameMap[1][5] = . (int 46)
Updates neighbours at iteration 22: 26

While at 23 of (27)

node 2 5 18

Updates neighbours at iteration 23: 26

While at 24 of (27)

node 4 5 19

Updates neighbours at iteration 24: 26

While at 25 of (27)

node 0 4 21

DX =schemaData.gameMap[0][5] = D (int 68)
Updates neighbours at iteration 25: 27

While at 26 of (28)

node 1 5 22

Updates neighbours at iteration 26: 27

While at 27 of (28)

node 0 5 25

Updates neighbours at iteration 27: 27

Is a door: (0,0) == (0,5)?
Is a door: (0,1) == (0,5)?
Is a door: (1,0) == (0,5)?
Is a door: (0,0) == (0,5)?
Is a door: (1,1) == (0,5)?
Is a door: (2,0) == (0,5)?
Is a door: (2,1) == (0,5)?
Is a door: (3,0) == (0,5)?
Is a door: (3,1) == (0,5)?
Is a door: (4,0) == (0,5)?
Is a door: (3,2) == (0,5)?
Is a door: (4,1) == (0,5)?
Is a door: (3,3) == (0,5)?
Is a door: (4,2) == (0,5)?
Is a door: (2,3) == (0,5)?
Is a door: (3,4) == (0,5)?
Is a door: (4,3) == (0,5)?
Is a door: (1,3) == (0,5)?
Is a door: (2,4) == (0,5)?
Is a door: (3,5) == (0,5)?
Is a door: (4,4) == (0,5)?
Is a door: (0,3) == (0,5)?
Is a door: (1,4) == (0,5)?
Is a door: (2,5) == (0,5)?
Is a door: (4,5) == (0,5)?
Is a door: (0,4) == (0,5)?
Is a door: (1,5) == (0,5)?
Is a door: (0,5) == (0,5)?
END->(0,5)->(0,4)->(0,3)->(1,3)->(2,3)->(3,3)->(3,2)->(3,1)->(2,1)->
(1,1)->(0,1)->(0,0)->START

door = 0 , route weigth= 12
Is a door: (0,0) == (4,5)?
Is a door: (0,1) == (4,5)?
Is a door: (1,0) == (4,5)?
Is a door: (0,0) == (4,5)?
Is a door: (1,1) == (4,5)?
Is a door: (2,0) == (4,5)?
Is a door: (2,1) == (4,5)?
Is a door: (3,0) == (4,5)?
Is a door: (3,1) == (4,5)?
Is a door: (4,0) == (4,5)?
Is a door: (3,2) == (4,5)?
Is a door: (4,1) == (4,5)?
Is a door: (3,3) == (4,5)?
Is a door: (4,2) == (4,5)?
Is a door: (2,3) == (4,5)?
Is a door: (3,4) == (4,5)?
Is a door: (4,3) == (4,5)?
Is a door: (1,3) == (4,5)?
Is a door: (2,4) == (4,5)?
Is a door: (3,5) == (4,5)?
Is a door: (4,4) == (4,5)?
Is a door: (0,3) == (4,5)?
Is a door: (1,4) == (4,5)?
Is a door: (2,5) == (4,5)?
Is a door: (4,5) == (4,5)?
END->(4,5)->(3,5)->(3,4)->(3,3)->(3,2)->(3,1)->(2,1)->(1,1)->(0,1)->
(0,0)->START

door = 1 , route weigth= 10
BESTROUTE.bestroute() - END

***** END FUNCTIONS TRACING MESSAGES:


Test on bestroute() - valid data, know input assert ok!

