
***** 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 . (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 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 . (int 46)

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

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

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

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

OBJECT.isaccessible() - 'returns' FALSE- 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 . (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)
DX =schemaData.gameMap[0][2] = . (int 46)
DW =schemaData.gameMap[1][1] = . (int 46)
Updates neighbours at iteration 1: 5

While at 2 of (6)

node 1 0 0

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

While at 3 of (7)

node 0 0 1

Updates neighbours at iteration 3: 6

While at 4 of (7)

node 0 2 1

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

While at 5 of (8)

node 1 1 1

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

While at 6 of (9)

node 2 0 2

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

While at 7 of (10)

node 1 2 4

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

While at 8 of (11)

node 2 1 5

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

While at 9 of (12)

node 3 0 6

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

While at 10 of (13)

node 2 2 7

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

While at 11 of (15)

node 3 1 8

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

While at 12 of (16)

node 4 0 9

Updates neighbours at iteration 12: 15

While at 13 of (16)

node 2 3 10

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

While at 14 of (18)

node 3 2 10

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

While at 15 of (19)

node 4 1 11

Updates neighbours at iteration 15: 18

While at 16 of (19)

node 2 4 13

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

While at 17 of (21)

node 3 3 13

DW =schemaData.gameMap[4][3] = . (int 46)
Updates neighbours at iteration 17: 21

While at 18 of (22)

node 4 2 14

Updates neighbours at iteration 18: 21

While at 19 of (22)

node 2 5 16

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

While at 20 of (23)

node 3 4 16

DW =schemaData.gameMap[4][4] = . (int 46)
Updates neighbours at iteration 20: 23

While at 21 of (24)

node 4 3 17

Updates neighbours at iteration 21: 23

While at 22 of (24)

node 3 5 19

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

While at 23 of (25)

node 4 4 20

Updates neighbours at iteration 23: 24

While at 24 of (25)

node 4 5 22

Updates neighbours at iteration 24: 24

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: (0,2) == (0,5)?
Is a door: (1,1) == (0,5)?
Is a door: (2,0) == (0,5)?
Is a door: (1,2) == (0,5)?
Is a door: (2,1) == (0,5)?
Is a door: (3,0) == (0,5)?
Is a door: (2,2) == (0,5)?
Is a door: (3,1) == (0,5)?
Is a door: (4,0) == (0,5)?
Is a door: (2,3) == (0,5)?
Is a door: (3,2) == (0,5)?
Is a door: (4,1) == (0,5)?
Is a door: (2,4) == (0,5)?
Is a door: (3,3) == (0,5)?
Is a door: (4,2) == (0,5)?
Is a door: (2,5) == (0,5)?
Is a door: (3,4) == (0,5)?
Is a door: (4,3) == (0,5)?
Is a door: (3,5) == (0,5)?
Is a door: (4,4) == (0,5)?
Is a door: (4,5) == (0,5)?
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: (0,2) == (4,5)?
Is a door: (1,1) == (4,5)?
Is a door: (2,0) == (4,5)?
Is a door: (1,2) == (4,5)?
Is a door: (2,1) == (4,5)?
Is a door: (3,0) == (4,5)?
Is a door: (2,2) == (4,5)?
Is a door: (3,1) == (4,5)?
Is a door: (4,0) == (4,5)?
Is a door: (2,3) == (4,5)?
Is a door: (3,2) == (4,5)?
Is a door: (4,1) == (4,5)?
Is a door: (2,4) == (4,5)?
Is a door: (3,3) == (4,5)?
Is a door: (4,2) == (4,5)?
Is a door: (2,5) == (4,5)?
Is a door: (3,4) == (4,5)?
Is a door: (4,3) == (4,5)?
Is a door: (3,5) == (4,5)?
Is a door: (4,4) == (4,5)?
Is a door: (4,5) == (4,5)?
END->(4,5)->(3,5)->(2,5)->(2,4)->(2,3)->(2,2)->(1,2)->(0,2)->(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!

