Server:Port  = localhost:34617
Client: calling server
Client: connected
>> Player
... World created, time: TimeDiff {tdYear=0, tdMonth=0, tdDay=0, tdHour=0, tdMin=0, tdSec=0, tdPicosec=139000000}
length homeslist: 4
~4~4~4~4~4~4~4~4~4~4~0flooding done
voronoi time: TimeDiff {tdYear=0, tdMonth=0, tdDay=0, tdHour=0, tdMin=0, tdSec=0, tdPicosec=796000000}
number = 1
CPU time already used: 0 
 rounded to 0 milliseconds 
 average:  0 milliseconds per move.
<< #241 X 1 Y 3 #666 X 1 Y 4
new info: id = 241, capacity = 10, money = 500, score = 0
packs = []
poss = [(241,(1,3)),(666,(1,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 500, score = 0
packs = []
poss = [(241,(1,3)),(666,(1,4))]

fork suggestors ...
... sugg***PATTI: goto home: (10,3)
user wants direction from (1,3) to (10,3)
user wants path from (1,3) to (10,3)
shortest path from (1,3) to (10,3)
~2~6~8~8~8flooding done
shortest path from (1,3) to (10,3)
is  Way {len=9, pos=(5,3)}
here it is: [(1,3),(2,3),(3,3),(4,3),(5,3),(6,3),(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Pick),(0,1 Drop)]
estors forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move S)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 2
CPU time already used: 10000000000 
 rounded to 10 milliseconds 
 average:  5 milliseconds per move.
<< #241 X 1 Y 3 E #666 X 1 Y 4 E
new info: id = 241, capacity = 10, money = 499, score = 0
packs = []
poss = [(241,(2,3)),(666,(2,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 499, score = 0
packs = []
poss = [(241,(2,3)),(666,(2,4))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,3)
user wants direction from (2,3) to (10,3)
user wants path from (2,3) to (10,3)
shortest path from (2,3) to (10,3)
~2~7~10~9flooding done
shortest path from (2,3) to (10,3)
is  Way {len=8, pos=(6,3)}
here it is: [(2,3),(3,3),(4,3),(5,3),(6,3),(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
first item: Just (1,1 Move E)
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
next item: Just (0,1 Move N)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 3
CPU time already used: 30000000000 
 rounded to 30 milliseconds 
 average:  10 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 498, score = 0
packs = []
poss = [(241,(3,3)),(666,(3,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 498, score = 0
packs = []
poss = [(241,(3,3)),(666,(3,4))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,3)
user wants direction from (3,3) to (10,3)
user wants path from (3,3) to (10,3)
shortest path from (3,3) to (10,3)
~2~7~11~11flooding done
shortest path from (3,3) to (10,3)
is  Way {len=7, pos=(7,3)}
here it is: [(3,3),(4,3),(5,3),(6,3),(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
first item: Just (1,1 Move E)
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
next item: Just (0,1 Move S)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 4
CPU time already used: 50000000000 
 rounded to 50 milliseconds 
 average:  12 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 497, score = 0
packs = []
poss = [(241,(4,3)),(666,(4,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 497, score = 0
packs = []
poss = [(241,(4,3)),(666,(4,4))]

fork suggestors ...
... sugge*ps*ot*soPsrAisTb TlfIeo: r ckgoeomdtm
oa nhdosm:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E4),,3()0 ,t1o  M(o1v0e, 3W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(4,f3i)r stto  i(t1e0m,:3 )J
usts h(o0r,t1e sMto vpea tEh) 
from (4,3) to (10,3)
~2~7~11flooding done
shortest path from (4,3) to (10,3)
is  Way {len=6, pos=(7,3)}
here it is: [(4,3),(5,3),(6,3),(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 5
CPU time already used: 70000000000 
 rounded to 70 milliseconds 
 average:  14 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 496, score = 0
packs = []
poss = [(241,(5,3)),(666,(5,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 496, score = 0
packs = []
poss = [(241,(5,3)),(666,(5,4))]

fork suggestors ...
... suggestors fo***PATTI: goto home: (10,3)
user wants direction from (5,3) to (10,3)
user wants path from (5,3) to (10,3)
shortest path from (5,3) to (10,3)
~2~7~11flooding done
shortest path from (5,3) to (10,3)
is  Way {len=5, pos=(7,3)}
here it is: [(5,3),(6,3),(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
rked
first item: Just (1,1 Move E)
next item: Just (0,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 6
CPU time already used: 90000000000 
 rounded to 90 milliseconds 
 average:  15 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 495, score = 0
packs = []
poss = [(241,(6,3)),(666,(6,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 495, score = 0
packs = []
poss = [(241,(6,3)),(666,(6,4))]

fork suggestors ...
... suggestors *pf*oo*srPskAieTbdTl
Ie:  cgoomtmoa nhdosm:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E6),,3()0 ,t1o  M(o1v0e, 3W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(6,f3i)r stto  i(t1e0m,:3 )J
usts h(o0r,t1e sMto vpea tSh) 
from (6,3) to (10,3)
~2~7flooding done
shortest path from (6,3) to (10,3)
is  Way {len=4, pos=(8,3)}
here it is: [(6,3),(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 7
CPU time already used: 100000000000 
 rounded to 100 milliseconds 
 average:  14 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 494, score = 0
packs = []
poss = [(241,(7,3)),(666,(7,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 494, score = 0
packs = []
poss = [(241,(7,3)),(666,(7,4))]

fork suggestors ...
... su***PATTI: goto home: (10,3)
user wants direction from (7,3) to (10,3)
user wants path from (7,3) to (10,3)
shortest path from (7,3) to (10,3)
~2~7flooding done
shortest path from (7,3) to (10,3)
is  Way {len=3, pos=(9,3)}
here it is: [(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
ggestors forked
first item: Just (1,1 Move E)
next item: Just (0,1 Drop)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 8
CPU time already used: 120000000000 
 rounded to 120 milliseconds 
 average:  15 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 493, score = 0
packs = []
poss = [(241,(8,3)),(666,(8,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 493, score = 0
packs = []
poss = [(241,(8,3)),(666,(8,4))]

fork suggestors ...
... suggestors ***PATTI: goto home: (10,3)
user wants direction from (8,3) to (10,3)
user wants path from (8,3) to (10,3)
shortest path from (8,3) to (10,3)
~2flooding done
shortest path from (8,3) to (10,3)
is  Way {len=2, pos=(9,3)}
here it is: [(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 9
CPU time already used: 140000000000 
 rounded to 140 milliseconds 
 average:  15 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 492, score = 0
packs = []
poss = [(241,(9,3)),(666,(9,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 492, score = 0
packs = []
poss = [(241,(9,3)),(666,(9,4))]

fork suggestors ...
... sugges*pt*oo*srPssAi TbfTloIer: k cegodom
tmoa nhdosm:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E9),,3()0 ,t1o  M(o1v0e, 3W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(9,f3i)r stto  i(t1e0m,:3 )J
usts h(o0r,t1e sMto vpea tEh) 
from (9,3) to (10,3)
~2flooding done
shortest path from (9,3) to (10,3)
is  Way {len=1, pos=(9,3)}
here it is: [(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 10
CPU time already used: 160000000000 
 rounded to 160 milliseconds 
 average:  16 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 491, score = 0
packs = []
poss = [(241,(10,3)),(666,(10,4))]

<< 10 1 3 2 11 1 3 2 12 1 3 2 13 1 3 2 14 1 3 2 15 1 3 2 16 1 3 2 17 1 3 2 18 1 3 2 19 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 491, score = 0
packs = []
poss = [(241,(10,3)),(666,(10,4))]

fork suggestors ...
... sugpgoessstiobrlse  fcoormkmeadn
ds:f i[r(s0t, 1i tMeomv:e  JNu)s,t( 0(,11, 1M oPviec kS )1,5( 01,61  1M7o v1e8  W1)9,)(
0,1 Pick 10 11 12 13 14 15 16 17 18 19),(0,1 Drop)]
next item: Just (0,1 Pick 10 11 12 13 14 15 16 17 18 19)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick 15 16 17 18 19
number = 11
CPU time already used: 180000000000 
 rounded to 180 milliseconds 
 average:  16 milliseconds per move.
<< #241 P 15 P 16 P 17 P 18 P 19 #666 P 20 P 21 P 22 P 23 P 24
new info: id = 241, capacity = 10, money = 490, score = 0
packs = [(241,[15,16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(10,3)),(666,(10,4))]

<< 10 1 3 2 11 1 3 2 12 1 3 2 13 1 3 2 14 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 490, score = 0
packs = [(241,[15,16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(10,3)),(666,(10,4))]

fork suggestors ...
.***PATTI: goto dest: (1,3)
user wants direction from (10,3) to (1,3)
user wants path from (10,3) to (1,3)
shortest path from (10,3) to (1,3)
~2~6~8~8~8flooding done
shortest path from (10,3) to (1,3)
is  Way {len=9, pos=(6,3)}
here it is: [(10,3),(9,3),(8,3),(7,3),(6,3),(5,3),(4,3),(3,3),(2,3),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick 10 11 12 13 14),(0,1 Drop 15)]
.. suggestors forked
first item: Just (1,1 Move W)
next item: Just (0,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 12
CPU time already used: 200000000000 
 rounded to 200 milliseconds 
 average:  16 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 489, score = 0
packs = [(241,[15,16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(9,3)),(666,(9,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 489, score = 0
packs = [(241,[15,16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(9,3)),(666,(9,4))]

fork suggestors ...
... suggestpoorsss ifbolrek ecdo
mmands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 15)]
first item: Just (0,1 Drop 15)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 15
number = 13
CPU time already used: 1080000000000 
 rounded to 1080 milliseconds 
 average:  83 milliseconds per move.
<< #241 D 15 #666 W
new info: id = 241, capacity = 10, money = 488, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(9,3)),(666,(8,4))]

<< 15 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 488, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(9,3)),(666,(8,4))]

fork suggestors ...
... suggestpoorsss ifbolrek ecdo
mmands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 15),(0,1 Drop 16)]
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 14
CPU time already used: 1660000000000 
 rounded to 1660 milliseconds 
 average:  118 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 487, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(9,2)),(666,(7,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 487, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(9,2)),(666,(7,4))]

fork suggestors ...
... suggeupssotesorsr iswb alfneot rsck oepmdam
tahn dfsr:o m[ ((09,,12 )M otvoe  (N1),,3()0
,1 sMhoovret eEs)t, (p0a,t1h  Mforvoem  W()9,,(20), 1t oP i(c1k,)3,)(
0,1~ 2Dr~o6p ~186)~]9
~9fifrlsoto diitnegm :d oJnues
t (s0h,o1r tDersotp  p1a6t)h
 from (9,2) to (1,3)
is  Way {len=9, pos=(5,2)}
here it is: [(9,2),(8,2),(7,2),(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (9,2) to (1,3)
shortest path from (9,2) to (1,3)
~2~6~8~9~9flooding done
shortest path from (9,2) to (1,3)
is  Way {len=9, pos=(5,2)}
here it is: [(9,2),(8,2),(7,2),(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (9,2) to (1,3)
shortest path from (9,2) to (1,3)
~2~6~8~9~9flooding done
shortest path from (9,2) to (1,3)
is  Way {len=9, pos=(5,2)}
here it is: [(9,2),(8,2),(7,2),(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (9,2) to (1,3)
shortest path from (9,2) to (1,3)
~2~6~8~9~9flooding done
shortest path from (9,2) to (1,3)
is  Way {len=9, pos=(5,2)}
here it is: [(9,2),(8,2),(7,2),(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (9,2) to (1,3)
user wants path from (9,2) to (1,3)
shortest path from (9,2) to (1,3)
~2~6~8~9~9flooding done
shortest path from (9,2) to (1,3)
is  Way {len=9, pos=(5,2)}
here it is: [(9,2),(8,2),(7,2),(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 15
CPU time already used: 1690000000000 
 rounded to 1690 milliseconds 
 average:  112 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 486, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(8,2)),(666,(6,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 486, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(8,2)),(666,(6,4))]

fork suggestors ...
... suggestuposoressrs  ifwboalrnekt escd o
pmamtahn dfsr:o m[ ((08,,12 )M otvoe  (N1),,3()0
,1 sMhoovret eEs)t, (p0a,t1h  Mforvoem  W()8,,(20), 1t oP i(c1k,)3,)(
0,1~ 2Dr~o6p ~196)~]1
0ffliorosdti nigt edmo:n eJ
usts h(o0r,t1e sMto vpea tNh) 
from (8,2) to (1,3)
is  Way {len=8, pos=(5,3)}
here it is: [(8,2),(7,2),(6,2),(5,2),(5,3),(4,3),(3,3),(2,3),(1,3)]
user wants path from (8,2) to (1,3)
shortest path from (8,2) to (1,3)
~2~6~9~10flooding done
shortest path from (8,2) to (1,3)
is  Way {len=8, pos=(5,3)}
here it is: [(8,2),(7,2),(6,2),(5,2),(5,3),(4,3),(3,3),(2,3),(1,3)]
user wants path from (8,2) to (1,3)
shortest path from (8,2) to (1,3)
~2~6~9~10flooding done
shortest path from (8,2) to (1,3)
is  Way {len=8, pos=(5,3)}
here it is: [(8,2),(7,2),(6,2),(5,2),(5,3),(4,3),(3,3),(2,3),(1,3)]
user wants path from (8,2) to (1,3)
shortest path from (8,2) to (1,3)
~2~6~9~10flooding done
shortest path from (8,2) to (1,3)
is  Way {len=8, pos=(5,3)}
here it is: [(8,2),(7,2),(6,2),(5,2),(5,3),(4,3),(3,3),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (8,2) to (1,3)
user wants path from (8,2) to (1,3)
shortest path from (8,2) to (1,3)
~2~6~9~10flooding done
shortest path from (8,2) to (1,3)
is  Way {len=8, pos=(5,3)}
here it is: [(8,2),(7,2),(6,2),(5,2),(5,3),(4,3),(3,3),(2,3),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 16
CPU time already used: 1710000000000 
 rounded to 1710 milliseconds 
 average:  106 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 485, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(7,2)),(666,(5,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 485, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(7,2)),(666,(5,4))]

fork suggestors ...
... suggestors fouser wants path from (7r,pk2oe)sd s
tiob l(e1 ,c3o)m
mansdhso:r t[e(s0t, 1p aMtohv ef rNo)m, ((07,,12 )M otvoe  (E1),,3()0
,1 ~M2ov~e6 W~)9,(~01,11 fPliocokd)i,n(g0 ,d1o nDer
op s1h6o)r]t
estf iprastth  iftreomm:  (J7u,s2t)  (t0o, 1( 1P,i3c)k
)
is  Way {len=7, pos=(4,3)}
here it is: [(7,2),(6,2),(5,2),(4,2),(4,3),(3,3),(2,3),(1,3)]
user wants path from (7,2) to (1,3)
shortest path from (7,2) to (1,3)
~2~6~9~11flooding done
shortest path from (7,2) to (1,3)
is  Way {len=7, pos=(4,3)}
here it is: [(7,2),(6,2),(5,2),(4,2),(4,3),(3,3),(2,3),(1,3)]
user wants path from (7,2) to (1,3)
shortest path from (7,2) to (1,3)
~2~6~9~11flooding done
shortest path from (7,2) to (1,3)
is  Way {len=7, pos=(4,3)}
here it is: [(7,2),(6,2),(5,2),(4,2),(4,3),(3,3),(2,3),(1,3)]
user wants path from (7,2) to (1,3)
shortest path from (7,2) to (1,3)
~2~6~9~11flooding done
shortest path from (7,2) to (1,3)
is  Way {len=7, pos=(4,3)}
here it is: [(7,2),(6,2),(5,2),(4,2),(4,3),(3,3),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (7,2) to (1,3)
user wants path from (7,2) to (1,3)
shortest path from (7,2) to (1,3)
~2~6~9~11flooding done
shortest path from (7,2) to (1,3)
is  Way {len=7, pos=(4,3)}
here it is: [(7,2),(6,2),(5,2),(4,2),(4,3),(3,3),(2,3),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 17
CPU time already used: 1730000000000 
 rounded to 1730 milliseconds 
 average:  101 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 484, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(6,2)),(666,(4,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 484, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(6,2)),(666,(4,4))]

fork suggestors ...
... suggestors forked
user wants path from (6,2) to (1,3)
shortest path from (6,2) to (1,3)
~2~6~9flooding done
shortest path from (6,2) to (1,3)
is  Way {len=6, pos=(3,2)}
here it is: [(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (6,2) to (1,3)
shortest path from (6,2) to (1,3)
~2~6~9flooding done
shortest path from (6,2) to (1,3)
is  Way {len=6, pos=(3,2)}
here it is: [(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (6,2) to (1,3)
shortest path from (6,2) to (1,3)
~2~6~9flooding done
shortest path from (6,2) to (1,3)
is  Way {len=6, pos=(3,2)}
here it is: [(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (6,2) to (1,3)
shortest path from (6,2) to (1,3)
~2~6~9flooding done
shortest path from (6,2) to (1,3)
is  Way {len=6, pos=(3,2)}
here it is: [(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (6,2) to (1,3)
user wants path from (6,2) to (1,3)
shortest path from (6,2) to (1,3)
~2~6~9flooding done
shortest path from (6,2) to (1,3)
is  Way {len=6, pos=(3,2)}
here it is: [(6,2),(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
first item: Just (1,1 Move W)
possible commands: [(0,1 Move N),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 16)]
next item: Just (0,1 Pick)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 18
CPU time already used: 1750000000000 
 rounded to 1750 milliseconds 
 average:  97 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 483, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(5,2)),(666,(3,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 483, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(5,2)),(666,(3,4))]

fork suggestors ...
... suggestorsup sofesorsr ikwbealdne
t sc opmamtahn dfsr:o m[ ((05,,12 )M otvoe  (N1),,3()0
,1 sMhoovret eEs)t, (p0a,t1h  Mforvoem  W()5,,(20), 1t oP i(c1k,)3,)(
0,1~ 2Dr~o6p ~196)f]l
oodfiinrgs td ointee
m: sJhuosrtt e(s0t, 1p aMtohv ef rEo)m
 (5,2) to (1,3)
is  Way {len=5, pos=(3,2)}
here it is: [(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (5,2) to (1,3)
shortest path from (5,2) to (1,3)
~2~6~9flooding done
shortest path from (5,2) to (1,3)
is  Way {len=5, pos=(3,2)}
here it is: [(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (5,2) to (1,3)
shortest path from (5,2) to (1,3)
~2~6~9flooding done
shortest path from (5,2) to (1,3)
is  Way {len=5, pos=(3,2)}
here it is: [(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
user wants path from (5,2) to (1,3)
shortest path from (5,2) to (1,3)
~2~6~9flooding done
shortest path from (5,2) to (1,3)
is  Way {len=5, pos=(3,2)}
here it is: [(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (5,2) to (1,3)
user wants path from (5,2) to (1,3)
shortest path from (5,2) to (1,3)
~2~6~9flooding done
shortest path from (5,2) to (1,3)
is  Way {len=5, pos=(3,2)}
here it is: [(5,2),(4,2),(3,2),(2,2),(1,2),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 19
CPU time already used: 1770000000000 
 rounded to 1770 milliseconds 
 average:  93 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 482, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(4,2)),(666,(2,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 482, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(4,2)),(666,(2,4))]

fork suggestors ...
... suggestuposoressrs  ifwboalrnekt escd o
pmamtahn dfsr:o m[ ((04,,12 )M otvoe  (N1),,3()0
,1 sMhoovret eEs)t, (p0a,t1h  Mforvoem  W()4,,(20), 1t oP i(c1k,)3,)(
0,1~ 2Dr~o6p f1l6o)o]d
ingf idrosnte 
itesmh:o rJtuesstt  (p0a,t1h  Dfrroopm  1(64),
2) to (1,3)
is  Way {len=4, pos=(3,3)}
here it is: [(4,2),(3,2),(3,3),(2,3),(1,3)]
user wants path from (4,2) to (1,3)
shortest path from (4,2) to (1,3)
~2~6flooding done
shortest path from (4,2) to (1,3)
is  Way {len=4, pos=(3,3)}
here it is: [(4,2),(3,2),(3,3),(2,3),(1,3)]
user wants path from (4,2) to (1,3)
shortest path from (4,2) to (1,3)
~2~6flooding done
shortest path from (4,2) to (1,3)
is  Way {len=4, pos=(3,3)}
here it is: [(4,2),(3,2),(3,3),(2,3),(1,3)]
user wants path from (4,2) to (1,3)
shortest path from (4,2) to (1,3)
~2~6flooding done
shortest path from (4,2) to (1,3)
is  Way {len=4, pos=(3,3)}
here it is: [(4,2),(3,2),(3,3),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (4,2) to (1,3)
user wants path from (4,2) to (1,3)
shortest path from (4,2) to (1,3)
~2~6flooding done
shortest path from (4,2) to (1,3)
is  Way {len=4, pos=(3,3)}
here it is: [(4,2),(3,2),(3,3),(2,3),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 20
CPU time already used: 1790000000000 
 rounded to 1790 milliseconds 
 average:  89 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 481, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(3,2)),(666,(1,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 481, score = 0
packs = [(241,[16,17,18,19]),(666,[20,21,22,23,24])]
poss = [(241,(3,2)),(666,(1,4))]

fork suggestors ...
... suggestors fouser wants path from (3,2) to (1,3)
shortest path from (3,2) to (1,3)
~2~6flooding done
shortest path from (3,2) to (1,3)
is  Way {len=3, pos=(2,3)}
here it is: [(3,2),(2,2),(2,3),(1,3)]
user wants path from (3,2) to (1,3)
shortest path from (3,2) to (1,3)
~2~6flooding done
shortest path from (3,2) to (1,3)
is  Way {len=3, pos=(2,3)}
here it is: [(3,2),(2,2),(2,3),(1,3)]
user wants path from (3,2) to (1,3)
shortest path from (3,2) to (1,3)
~2~6flooding done
shortest path from (3,2) to (1,3)
is  Way {len=3, pos=(2,3)}
here it is: [(3,2),(2,2),(2,3),(1,3)]
user wants path from (3,2) to (1,3)
shortest path from (3,2) to (1,3)
~2~6flooding done
shortest path from (3,2) to (1,3)
is  Way {len=3, pos=(2,3)}
here it is: [(3,2),(2,2),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (3,2) to (1,3)
user wants path from (3,2) to (1,3)
shortest path from (3,2) to (1,3)
~2~6flooding done
shortest path from (3,2) to (1,3)
is  Way {len=3, pos=(2,3)}
here it is: [(3,2),(2,2),(2,3),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
possible commands: [(0,1 Move N),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 16)]
rked
first item: Just (1,1 Move W)
next item: Just (0,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 21
CPU time already used: 1810000000000 
 rounded to 1810 milliseconds 
 average:  86 milliseconds per move.
<< #241 W #666 D 24 D 23 D 22 D 21 D 20
new info: id = 241, capacity = 10, money = 480, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(2,2)),(666,(1,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 480, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(2,2)),(666,(1,4))]

fork suggestors ...
... sugguser wants path from (2,2) to (1,3)
shortest path from (2,2) to (1,3)
~2flooding done
shortest path from (2,2) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,2),(2,3),(1,3)]
user wants path from (2,2) to (1,3)
shortest path from (2,2) to (1,3)
~2flooding done
shortest path from (2,2) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,2),(2,3),(1,3)]
user wants path from (2,2) to (1,3)
shortest path from (2,2) to (1,3)
~2flooding done
shortest path from (2,2) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,2),(2,3),(1,3)]
user wants path from (2,2) to (1,3)
shortest path from (2,2) to (1,3)
~2flooding done
shortest path from (2,2) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,2),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (2,2) to (1,3)
user wants path from (2,2) to (1,3)
shortest path from (2,2) to (1,3)
~2flooding done
shortest path from (2,2) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,2),(2,3),(1,3)]
suggested directions are [N]
***PATTI: the cmd is 1 Move N
possible commands: [(0,1 Move N),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 16)]
estors forked
first item: Just (1,1 Move N)
next item: Just (0,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 22
CPU time already used: 1830000000000 
 rounded to 1830 milliseconds 
 average:  83 milliseconds per move.
<< #241 N #666 E
new info: id = 241, capacity = 10, money = 479, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(2,3)),(666,(2,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 479, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(2,3)),(666,(2,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 16)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 23
CPU time already used: 2620000000000 
 rounded to 2620 milliseconds 
 average:  113 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 478, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(3,3)),(666,(3,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 478, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(3,3)),(666,(3,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 16)]
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 24
CPU time already used: 3170000000000 
 rounded to 3170 milliseconds 
 average:  132 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 477, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(3,3)),(666,(4,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 477, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(3,3)),(666,(4,4))]

fork suggestors ...
... suggpeosstsoirbsl ef ocrokmemda
nds: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 16)]
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 25
CPU time already used: 3760000000000 
 rounded to 3760 milliseconds 
 average:  150 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 476, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(3,3)),(666,(5,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 476, score = 0
packs = [(241,[16,17,18,19]),(666,[])]
poss = [(241,(3,3)),(666,(5,4))]

fork suggestors ...
... supossible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 16)]
ggestors forked
first item: Just (0,1 Drop 16)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 16
number = 26
CPU time already used: 4340000000000 
 rounded to 4340 milliseconds 
 average:  166 milliseconds per move.
<< #241 D 16 #666 E
new info: id = 241, capacity = 10, money = 475, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(3,3)),(666,(6,4))]

<< 16 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 475, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(3,3)),(666,(6,4))]

fork suggestors ...
... suggestorpso sfsoirbkleed 
commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 16),(0,1 Drop 17)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 27
CPU time already used: 4830000000000 
 rounded to 4830 milliseconds 
 average:  178 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 474, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(4,3)),(666,(7,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 474, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(4,3)),(666,(7,4))]

fork suggestors ...
... suggpossible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 17)]
estors forked
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 28
CPU time already used: 5400000000000 
 rounded to 5400 milliseconds 
 average:  192 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 473, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(5,3)),(666,(8,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 473, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(5,3)),(666,(8,4))]

fork suggestors ...
... suggpossible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 17)]
estors forked
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 29
CPU time already used: 5970000000000 
 rounded to 5970 milliseconds 
 average:  205 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 472, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(6,3)),(666,(9,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 472, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(6,3)),(666,(9,4))]

fork suggestors ...
... suggpossible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 17)]
estors forked
first item: Just (0,1 Move N)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 30
CPU time already used: 6480000000000 
 rounded to 6480 milliseconds 
 average:  216 milliseconds per move.
<< #241 N #666 E
new info: id = 241, capacity = 10, money = 471, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(6,4)),(666,(10,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 471, score = 0
packs = [(241,[17,18,19]),(666,[])]
poss = [(241,(6,4)),(666,(10,4))]

fork suggestors ...
... sugupgsoeessrst iowbralsne t fsco orpmkametadhn
 dfsr:o m[ ((06,,14 )M otvoe  (N1),,3()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()6,,(40), 1t oM o(v1e, 3W))
,(0~,21 ~P7ic~k1)1,(f0l,o1o dDirnogp  d1o7n)e]

sfhiorrstte sitt epma:t hJ ufsrto m( 0(,61, 4P)i ctko) 
(1,3)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,3)]
user wants path from (6,4) to (1,3)
shortest path from (6,4) to (1,3)
~2~7~11flooding done
shortest path from (6,4) to (1,3)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,3)]
user wants path from (6,4) to (1,3)
shortest path from (6,4) to (1,3)
~2~7~11flooding done
shortest path from (6,4) to (1,3)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (6,4) to (1,3)
user wants path from (6,4) to (1,3)
shortest path from (6,4) to (1,3)
~2~7~11flooding done
shortest path from (6,4) to (1,3)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 31
CPU time already used: 6500000000000 
 rounded to 6500 milliseconds 
 average:  209 milliseconds per move.
<< #241 W #666 P 25 P 26 P 27 P 28 P 29
new info: id = 241, capacity = 10, money = 470, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(5,4)),(666,(10,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 470, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(5,4)),(666,(10,4))]

fork suggestors ...
... suggestors forked
user wants path from (5,4) to (1,3)
shortest path from (5,4) to (1,3)
~2~7~11flooding done
shortest path from (5,4) to (1,3)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,3)]
user wants path from (5,4) to (1,3)
shortest path from (5,4) to (1,3)
~2~7~11flooding done
shortest path from (5,4) to (1,3)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,3)]
user wants path from (5,4) to (1,3)
shortest path from (5,4) to (1,3)
~2~7~11flooding done
shortest path from (5,4) to (1,3)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (5,4) to (1,3)
user wants path from (5,4) to (1,3)
shortest path from (5,4) to (1,3)
~2~7~11flooding done
shortest path from (5,4) to (1,3)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
first item: Just (1,1 Move W)
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 17)]
next item: Just (0,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 32
CPU time already used: 6520000000000 
 rounded to 6520 milliseconds 
 average:  203 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 469, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(4,4)),(666,(9,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 469, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(4,4)),(666,(9,4))]

fork suggestors ...
...up sosesursg igwbealsnett oscr ospm amftaohnr dkfser:do 
m[ ((04,,14 )M otvoe  (N1),,3()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()4,,(40), 1t oM o(v1e, 3W))
,(0~,21 ~P7icfkl)o,o(d0i,n1g  Ddroonpe 
17)s]h
ortfeisrts tp aitthe mf:r oJmu s(t4 ,(40), 1t oM o(v1e, 3W))

is  Way {len=4, pos=(3,3)}
here it is: [(4,4),(3,4),(3,3),(2,3),(1,3)]
user wants path from (4,4) to (1,3)
shortest path from (4,4) to (1,3)
~2~7flooding done
shortest path from (4,4) to (1,3)
is  Way {len=4, pos=(3,3)}
here it is: [(4,4),(3,4),(3,3),(2,3),(1,3)]
user wants path from (4,4) to (1,3)
shortest path from (4,4) to (1,3)
~2~7flooding done
shortest path from (4,4) to (1,3)
is  Way {len=4, pos=(3,3)}
here it is: [(4,4),(3,4),(3,3),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (4,4) to (1,3)
user wants path from (4,4) to (1,3)
shortest path from (4,4) to (1,3)
~2~7flooding done
shortest path from (4,4) to (1,3)
is  Way {len=4, pos=(3,3)}
here it is: [(4,4),(3,4),(3,3),(2,3),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 33
CPU time already used: 6540000000000 
 rounded to 6540 milliseconds 
 average:  198 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 468, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(3,4)),(666,(8,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 468, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(3,4)),(666,(8,4))]

fork suggestors ...
... suggestors forked
upsoesrs iwbalnet sc opmamtahn dfsr:o m[ ((03,,14 )M otvoe  (N1),,3()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()3,,(40), 1t oM o(v1e, 3W))
,(0~,21 ~P7icfkl)o,o(d0i,n1g  Ddroonpe 
17)s]h
ortfeisrts tp aitthe mf:r oJmu s(t3 ,(40), 1t oP i(c1k,)3
)
is  Way {len=3, pos=(2,3)}
here it is: [(3,4),(2,4),(2,3),(1,3)]
user wants path from (3,4) to (1,3)
shortest path from (3,4) to (1,3)
~2~7flooding done
shortest path from (3,4) to (1,3)
is  Way {len=3, pos=(2,3)}
here it is: [(3,4),(2,4),(2,3),(1,3)]
user wants path from (3,4) to (1,3)
shortest path from (3,4) to (1,3)
~2~7flooding done
shortest path from (3,4) to (1,3)
is  Way {len=3, pos=(2,3)}
here it is: [(3,4),(2,4),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (3,4) to (1,3)
user wants path from (3,4) to (1,3)
shortest path from (3,4) to (1,3)
~2~7flooding done
shortest path from (3,4) to (1,3)
is  Way {len=3, pos=(2,3)}
here it is: [(3,4),(2,4),(2,3),(1,3)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 34
CPU time already used: 6560000000000 
 rounded to 6560 milliseconds 
 average:  192 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 467, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,4)),(666,(7,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 467, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,4)),(666,(7,4))]

fork suggestors ...
... suggesuser wants path from (2,4) to (1,3)
shortest path from (2,4) to (1,3)
~2flooding done
shortest path from (2,4) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,4),(2,3),(1,3)]
tpouorssses rif bowlraekn etcdso
 mpmaatnhd sf:r o[m( 0(,21, 4M)o vteo  N()1,,(30),
1 Msohvoer tSe)s,t( 0p,a1t hM ofvreo mE )(,2(,04,)1  tMoo v(e1 ,W3)),
(0,~12 Pfilcoko)d,i(n0g, 1d oDnreo
p 1s7h)o]r
tesfti rpsatt hi tfermo:m  J(u2s,t4 )( 0t,o1  (M1o,v3e) 
E)
is  Way {len=2, pos=(2,3)}
here it is: [(2,4),(2,3),(1,3)]
user wants path from (2,4) to (1,3)
shortest path from (2,4) to (1,3)
~2flooding done
shortest path from (2,4) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,4),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (2,4) to (1,3)
user wants path from (2,4) to (1,3)
shortest path from (2,4) to (1,3)
~2flooding done
shortest path from (2,4) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,4),(2,3),(1,3)]
suggested directions are [S]
***PATTI: the cmd is 1 Move S
next item: Just (1,1 Move S)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 35
CPU time already used: 6580000000000 
 rounded to 6580 milliseconds 
 average:  188 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 466, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(6,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 466, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(6,4))]

fork suggestors ...
...p ossusgigbelset ocrosm mfaonrdkse:d 
[(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 17)]
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 36
CPU time already used: 7430000000000 
 rounded to 7430 milliseconds 
 average:  206 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 465, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(5,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 465, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(5,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 17)]
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 37
CPU time already used: 7980000000000 
 rounded to 7980 milliseconds 
 average:  215 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 464, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(4,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 464, score = 0
packs = [(241,[17,18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(4,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 17)]
first item: Just (0,1 Drop 17)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 17
number = 38
CPU time already used: 8510000000000 
 rounded to 8510 milliseconds 
 average:  223 milliseconds per move.
<< #241 D 17 #666 W
new info: id = 241, capacity = 10, money = 463, score = 0
packs = [(241,[18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(3,4))]

<< 17 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 463, score = 0
packs = [(241,[18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(3,4))]

fork suggestors ...
... sugpgoessstiobrlse  fcoormkmeadn
ds: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 17),(0,1 Drop 18)]
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 39
CPU time already used: 9030000000000 
 rounded to 9030 milliseconds 
 average:  231 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 462, score = 0
packs = [(241,[18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,2)),(666,(2,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 462, score = 0
packs = [(241,[18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,2)),(666,(2,4))]

fork suggestors ...
user wants path from (2,2) to (1,3)
shortest path from (2,2) to (1,3)
~2flooding done
shortest path from (2,2) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,2),(2,3),(1,3)]
user wants path from (2,2) to (1,3)
shortest path from (2,2) to (1,3)
~2flooding done
shortest path from (2,2) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,2),(2,3),(1,3)]
***PATTI: goto dest: (1,3)
user wants direction from (2,2) to (1,3)
user wants path from (2,2) to (1,3)
shortest path from (2,2) to (1,3)
~2flooding done
shortest path from (2,2) to (1,3)
is  Way {len=2, pos=(2,3)}
here it is: [(2,2),(2,3),(1,3)]
suggested directions are [N]
***PATTI: the cmd is 1 Move N
possible commands: [(0,1 Move N),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 18)]
... suggestors forked
first item: Just (1,1 Move N)
next item: Just (0,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 40
CPU time already used: 9040000000000 
 rounded to 9040 milliseconds 
 average:  226 milliseconds per move.
<< #241 N #666 W
new info: id = 241, capacity = 10, money = 461, score = 0
packs = [(241,[18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(1,4))]

<< 17 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 461, score = 0
packs = [(241,[18,19]),(666,[25,26,27,28,29])]
poss = [(241,(2,3)),(666,(1,4))]

fork suggestors ...
... suggestors fpoorskseidb
le commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 17),(0,1 Drop 18)]
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 41
CPU time already used: 9630000000000 
 rounded to 9630 milliseconds 
 average:  234 milliseconds per move.
<< #241 W #666 D 29 D 28 D 27 D 26 D 25
new info: id = 241, capacity = 10, money = 460, score = 0
packs = [(241,[18,19]),(666,[])]
poss = [(241,(1,3)),(666,(1,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 460, score = 0
packs = [(241,[18,19]),(666,[])]
poss = [(241,(1,3)),(666,(1,4))]

fork suggestors ...
... suggestors forked
***PATTI: doing the drop
first item: Just (100,1 Drop 18 19)
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Pick),(0,1 Drop 18)]
next item: Just (0,1 Drop 18)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 18 19
number = 42
CPU time already used: 9640000000000 
 rounded to 9640 milliseconds 
 average:  229 milliseconds per move.
<< #241 D 18 D 19 #666 E
new info: id = 241, capacity = 10, money = 459, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(1,3)),(666,(2,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 459, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(1,3)),(666,(2,4))]

fork suggestors ...
... s***PATTI: goto home: (10,3)
user wants direction from (1,3) to (10,3)
user wants path from (1,3) to (10,3)
shortest path from (1,3) to (10,3)
~2~6~8~8~8flooding done
shortest path from (1,3) to (10,3)
is  Way {len=9, pos=(5,3)}
here it is: [(1,3),(2,3),(3,3),(4,3),(5,3),(6,3),(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Pick),(0,1 Drop)]
uggestors forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move N)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 43
CPU time already used: 9660000000000 
 rounded to 9660 milliseconds 
 average:  224 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 458, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(3,4))]

<< 17 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 458, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(3,4))]

fork suggestors ...
... suggestors forkpeods
sible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 17),(0,1 Drop)]
first item: Just (0,1 Drop)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 44
CPU time already used: 10530000000000 
 rounded to 10530 milliseconds 
 average:  239 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 457, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(4,4))]

<< 17 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 457, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(4,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 17),(0,1 Drop)]
first item: Just (0,1 Pick 17)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick 17
number = 45
CPU time already used: 11090000000000 
 rounded to 11090 milliseconds 
 average:  246 milliseconds per move.
<< #241 P 17 #666 E
new info: id = 241, capacity = 10, money = 456, score = 4
packs = [(241,[17]),(666,[])]
poss = [(241,(2,3)),(666,(5,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 456, score = 4
packs = [(241,[17]),(666,[])]
poss = [(241,(2,3)),(666,(5,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 17)]
first item: Just (0,1 Drop 17)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 17
number = 46
CPU time already used: 11580000000000 
 rounded to 11580 milliseconds 
 average:  251 milliseconds per move.
<< #241 D 17 #666 E
new info: id = 241, capacity = 10, money = 455, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(6,4))]

<< 17 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 455, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(6,4))]

fork suggestors ...
... suggestopossible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 17),(0,1 Drop)]
rs forked
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 47
CPU time already used: 12160000000000 
 rounded to 12160 milliseconds 
 average:  258 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 454, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(1,3)),(666,(7,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 454, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(1,3)),(666,(7,4))]

fork suggestors ...
... s*pu*og*sgPseAisTbtTloIer: s c gofomotmroak nehddos
m:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E1),,3()0 ,t1o  P(i1c0k,)3,)(
0,1u sDerro pw)a]n
ts fpiartsht  firtoemm :( 1J,u3s)t  t(o0 ,(11 0D,r3o)p
)
shortest path from (1,3) to (10,3)
~2~6~8~8~8flooding done
shortest path from (1,3) to (10,3)
is  Way {len=9, pos=(5,3)}
here it is: [(1,3),(2,3),(3,3),(4,3),(5,3),(6,3),(7,3),(8,3),(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 48
CPU time already used: 12180000000000 
 rounded to 12180 milliseconds 
 average:  253 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 453, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(8,4))]

<< 17 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 453, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(8,4))]

fork suggestors ...
... suggestors forkpeods
sible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 17),(0,1 Drop)]
first item: Just (0,1 Drop)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 49
CPU time already used: 12720000000000 
 rounded to 12720 milliseconds 
 average:  259 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 452, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(9,4))]

<< 17 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 452, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(2,3)),(666,(9,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 17),(0,1 Drop)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 50
CPU time already used: 13230000000000 
 rounded to 13230 milliseconds 
 average:  264 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 451, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(3,3)),(666,(10,4))]

<< 16 1 3 2
new info (pack_update): id = 241, capacity = 10, money = 451, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(3,3)),(666,(10,4))]

fork suggestors ...
... suggestorsp ofsosrikbelde
 commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 16),(0,1 Drop)]
first item: Just (0,1 Move N)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 51
CPU time already used: 13800000000000 
 rounded to 13800 milliseconds 
 average:  270 milliseconds per move.
<< #241 N #666 N
new info: id = 241, capacity = 10, money = 450, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(3,4)),(666,(10,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 450, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(3,4)),(666,(10,5))]

fork suggestors ...
...*p *os*suPsgAigTbeTlsIet: o crgosom tmfoao nrhdkosem:de 
:[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E3),,4()0 ,t1o  M(o1v0e, 4W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(3,f4i)r stto  i(t1e0m,:4 )J
usts h(o0r,t1e sMto vpea tEh) 
from (3,4) to (10,4)
~2~7~11~11flooding done
shortest path from (3,4) to (10,4)
is  Way {len=7, pos=(7,4)}
here it is: [(3,4),(4,4),(5,4),(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 52
CPU time already used: 13810000000000 
 rounded to 13810 milliseconds 
 average:  265 milliseconds per move.
<< #241 E #666 P 30 P 31 P 32 P 33 P 34
new info: id = 241, capacity = 10, money = 449, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(4,4)),(666,(10,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 449, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(4,4)),(666,(10,5))]

fork suggestors ...
... suggestors forked***PATTI: goto home: (10,4)
user wants direction from (4,4) to (10,4)
user wants path from (4,4) to (10,4)
shortest path from (4,4) to (10,4)
~2~7~11flooding done
shortest path from (4,4) to (10,4)
is  Way {len=6, pos=(7,4)}
here it is: [(4,4),(5,4),(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]

first item: Just (1,1 Move E)
next item: Just (0,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 53
CPU time already used: 13830000000000 
 rounded to 13830 milliseconds 
 average:  260 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 448, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(5,4)),(666,(9,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 448, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(5,4)),(666,(9,5))]

fork suggestors ...
..*p.*o *ssPsuAigTbgTleIes: t cogoromstm oaf nohdroskm:ee d:[
 ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E5),,4()0 ,t1o  M(o1v0e, 4W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(5,f4i)r stto  i(t1e0m,:4 )J
usts h(o0r,t1e sDtr oppa)t
h from (5,4) to (10,4)
~2~7~11flooding done
shortest path from (5,4) to (10,4)
is  Way {len=5, pos=(7,4)}
here it is: [(5,4),(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 54
CPU time already used: 13850000000000 
 rounded to 13850 milliseconds 
 average:  256 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 447, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(6,4)),(666,(8,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 447, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(6,4)),(666,(8,5))]

fork suggestors ...
... sugge***PATTI: goto home: (10,4)
user wants direction from (6,4) to (10,4)
user wants path from (6,4) to (10,4)
shortest path from (6,4) to (10,4)
~2~7flooding done
shortest path from (6,4) to (10,4)
is  Way {len=4, pos=(8,4)}
here it is: [(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
stors forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move S)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 55
CPU time already used: 13870000000000 
 rounded to 13870 milliseconds 
 average:  252 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 446, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(7,4)),(666,(7,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 446, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(7,4)),(666,(7,5))]

fork suggestors ...
... suggestors***PATTI: goto home: (10,4)
user wants direction from (7,4) to (10,4)
user wants path from (7,4) to (10,4)
shortest path from (7,4) to (10,4)
~2~7flooding done
shortest path from (7,4) to (10,4)
is  Way {len=3, pos=(9,4)}
here it is: [(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
 forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move S)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 56
CPU time already used: 13890000000000 
 rounded to 13890 milliseconds 
 average:  248 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 445, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(8,4)),(666,(6,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 445, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(8,4)),(666,(6,5))]

fork suggestors ...
...***PATTI: goto home: (10,4)
user wants direction from (8,4) to (10,4)
user wants path from (8,4) to (10,4)
shortest path from (8,4) to (10,4)
~2flooding done
shortest path from (8,4) to (10,4)
is  Way {len=2, pos=(9,4)}
here it is: [(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
 suggestors forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 57
CPU time already used: 13910000000000 
 rounded to 13910 milliseconds 
 average:  244 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 444, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(9,4)),(666,(5,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 444, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(9,4)),(666,(5,5))]

fork suggestors ...
... sug***PATTI: goto home: (10,4)
user wants direction from (9,4) to (10,4)
user wants path from (9,4) to (10,4)
shortest path from (9,4) to (10,4)
~2flooding done
shortest path from (9,4) to (10,4)
is  Way {len=1, pos=(9,4)}
here it is: [(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
gestors forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 58
CPU time already used: 13930000000000 
 rounded to 13930 milliseconds 
 average:  240 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 443, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(10,4)),(666,(4,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 443, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(10,4)),(666,(4,5))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,4)
user wants direction from (10,4) to (10,4)
user wants path from (10,4) to (10,4)
shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 59
CPU time already used: 13930000000000 
 rounded to 13930 milliseconds 
 average:  236 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 442, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(10,4)),(666,(3,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 442, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(10,4)),(666,(3,5))]

fork suggestors ...
... suggestors for*pk*oe*sdPs
AiTbTlIe:  cgoomtmoa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(40), 1t oP i(c1k0),,4()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t4 )( 0t,o1  (P1i0c,k4))

shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 60
CPU time already used: 13950000000000 
 rounded to 13950 milliseconds 
 average:  232 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 441, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(10,4)),(666,(2,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 441, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(10,4)),(666,(2,5))]

fork suggestors ...
... suggestors forked
*p*o*sPsAiTbTlIe:  cgoomtmoa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(40), 1t oP i(c1k0),,4()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t4 )( 0t,o1  (P1i0c,k4))

shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 61
CPU time already used: 13970000000000 
 rounded to 13970 milliseconds 
 average:  229 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 440, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(10,4)),(666,(1,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 440, score = 4
packs = [(241,[]),(666,[30,31,32,33,34])]
poss = [(241,(10,4)),(666,(1,5))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,4)
user wants direction from (10,4) to (10,4)
user wants path from (10,4) to (10,4)
shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
first item: Just (0,1 Move N)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 62
CPU time already used: 13990000000000 
 rounded to 13990 milliseconds 
 average:  225 milliseconds per move.
<< #241 N #666 D 34 D 33 D 32 D 31 D 30
new info: id = 241, capacity = 10, money = 439, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(1,5))]

<< 35 1 5 2 36 1 5 2 37 1 5 2 38 1 5 2 39 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 439, score = 4
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(1,5))]

fork suggestors ...
... suggestorpso sfsoirbkleed 
comfmiarnsdts :i t[e(m0:, 1J uMsotv e( 1S,)1, (P0i,c1k  M3o5v e3 6W )3,7( 03,81  3P9i)c
k 35 36 37 38 39),(0,1 Drop)]
next item: Just (0,1 Pick 35 36 37 38 39)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick 35 36 37 38 39
number = 63
CPU time already used: 14010000000000 
 rounded to 14010 milliseconds 
 average:  222 milliseconds per move.
<< #241 P 35 P 36 P 37 P 38 P 39 #666 E
new info: id = 241, capacity = 10, money = 438, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(10,5)),(666,(2,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 438, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(10,5)),(666,(2,5))]

fork suggestors ...
... suggesto*pr*os*s PsfAioTbrTlkIee: d c
goomtmoa nddess:t :[ ((01,,15 )M
oveu sSe)r, (w0a,n1t sM odvier eWc)t,i(o0n, 1f rPoimc k()1,0(,05,)1  tDor o(p1 ,355))
]
usfeirr swta nittse mp:a tJhu sftr o(m0 ,(11 0M,o5v)e  tWo) 
(1,5)
shortest path from (10,5) to (1,5)
~2~4~6~8~8flooding done
shortest path from (10,5) to (1,5)
is  Way {len=9, pos=(6,5)}
here it is: [(10,5),(9,5),(8,5),(7,5),(6,5),(5,5),(4,5),(3,5),(2,5),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 64
CPU time already used: 14030000000000 
 rounded to 14030 milliseconds 
 average:  219 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 437, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(9,5)),(666,(3,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 437, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(9,5)),(666,(3,5))]

fork suggestors ...
..p.o sssuigbglees tcoormsm afnodrsk:e d[
(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 65
CPU time already used: 14890000000000 
 rounded to 14890 milliseconds 
 average:  229 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 436, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(9,5)),(666,(4,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 436, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(9,5)),(666,(4,5))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 66
CPU time already used: 15460000000000 
 rounded to 15460 milliseconds 
 average:  234 milliseconds per move.
<< #241 S #666 E
new info: id = 241, capacity = 10, money = 435, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(9,4)),(666,(5,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 435, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(9,4)),(666,(5,5))]

fork suggestors ...
... suggestorsup sofesorsr ikwbealdne
t sc opmamtahn dfsr:o m[ ((09,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()9,,(40), 1t oM o(v1e, 5W))
,(0~,21 ~P6ic~k9),~(90,~18 Dfrloopo d3i5n)g] 
donfei
rsts hiotretme:s tJ upsatt h( 0f,r1o mM o(v9e, 4E)) 
to (1,5)
is  Way {len=9, pos=(5,4)}
here it is: [(9,4),(8,4),(7,4),(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (9,4) to (1,5)
shortest path from (9,4) to (1,5)
~2~6~9~9~8flooding done
shortest path from (9,4) to (1,5)
is  Way {len=9, pos=(5,4)}
here it is: [(9,4),(8,4),(7,4),(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (9,4) to (1,5)
shortest path from (9,4) to (1,5)
~2~6~9~9~8flooding done
shortest path from (9,4) to (1,5)
is  Way {len=9, pos=(5,4)}
here it is: [(9,4),(8,4),(7,4),(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (9,4) to (1,5)
shortest path from (9,4) to (1,5)
~2~6~9~9~8flooding done
shortest path from (9,4) to (1,5)
is  Way {len=9, pos=(5,4)}
here it is: [(9,4),(8,4),(7,4),(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (9,4) to (1,5)
shortest path from (9,4) to (1,5)
~2~6~9~9~8flooding done
shortest path from (9,4) to (1,5)
is  Way {len=9, pos=(5,4)}
here it is: [(9,4),(8,4),(7,4),(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (9,4) to (1,5)
user wants path from (9,4) to (1,5)
shortest path from (9,4) to (1,5)
~2~6~9~9~8flooding done
shortest path from (9,4) to (1,5)
is  Way {len=9, pos=(5,4)}
here it is: [(9,4),(8,4),(7,4),(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 67
CPU time already used: 15490000000000 
 rounded to 15490 milliseconds 
 average:  231 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 434, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(8,4)),(666,(6,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 434, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(8,4)),(666,(6,5))]

fork suggestors ...
... suggestors forked
user wants path from (8,4) to (1,5)
shortest path from (8,4) to (1,5)
~2~6~10~11flooding done
shortest path from (8,4) to (1,5)
is  Way {len=8, pos=(5,5)}
here it is: [(8,4),(7,4),(6,4),(5,4),(5,5),(4,5),(3,5),(2,5),(1,5)]
user wants path from (8,4) to (1,5)
shortest path from (8,4) to (1,5)
~2~6~10~11flooding done
shortest path from (8,4) to (1,5)
is  Way {len=8, pos=(5,5)}
here it is: [(8,4),(7,4),(6,4),(5,4),(5,5),(4,5),(3,5),(2,5),(1,5)]
user wants path from (8,4) to (1,5)
shortest path from (8,4) to (1,5)
~2~6~10~11flooding done
shortest path from (8,4) to (1,5)
is  Way {len=8, pos=(5,5)}
here it is: [(8,4),(7,4),(6,4),(5,4),(5,5),(4,5),(3,5),(2,5),(1,5)]
user wants path from (8,4) to (1,5)
shortest path from (8,4) to (1,5)
~2~6~10~11flooding done
shortest path from (8,4) to (1,5)
is  Way {len=8, pos=(5,5)}
here it is: [(8,4),(7,4),(6,4),(5,4),(5,5),(4,5),(3,5),(2,5),(1,5)]
user wants path from (8,4) to (1,5)
shortest path from (8,4) to (1,5)
~2~6~10~11flooding done
shortest path from (8,4) to (1,5)
is  Way {len=8, pos=(5,5)}
here it is: [(8,4),(7,4),(6,4),(5,4),(5,5),(4,5),(3,5),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (8,4) to (1,5)
user wants path from (8,4) to (1,5)
shortest path from (8,4) to (1,5)
~2~6~10~11flooding done
shortest path from (8,4) to (1,5)
is  Way {len=8, pos=(5,5)}
here it is: [(8,4),(7,4),(6,4),(5,4),(5,5),(4,5),(3,5),(2,5),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
first item: Just (1,1 Move W)
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
next item: Just (0,1 Drop 35)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 68
CPU time already used: 15510000000000 
 rounded to 15510 milliseconds 
 average:  228 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 433, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(7,4)),(666,(7,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 433, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(7,4)),(666,(7,5))]

fork suggestors ...
... sugguser wants path from (7,4) to (1,5)
shortest path from (7,4) to (1,5)
~2~6~10~12flooding done
shortest path from (7,4) to (1,5)
is  Way {len=7, pos=(4,5)}
here it is: [(7,4),(6,4),(5,4),(4,4),(4,5),(3,5),(2,5),(1,5)]
user wants path from (7,4) to (1,5)
shortest path from (7,4) to (1,5)
~2~6~10~12flooding done
shortest path from (7,4) to (1,5)
is  Way {len=7, pos=(4,5)}
here it is: [(7,4),(6,4),(5,4),(4,4),(4,5),(3,5),(2,5),(1,5)]
user wants path from (7,4) to (1,5)
shortest path from (7,4) to (1,5)
~2~6~10~12flooding done
shortest path from (7,4) to (1,5)
is  Way {len=7, pos=(4,5)}
here it is: [(7,4),(6,4),(5,4),(4,4),(4,5),(3,5),(2,5),(1,5)]
user wants path from (7,4) to (1,5)
shortest path from (7,4) to (1,5)
~2~6~10~12flooding done
shortest path from (7,4) to (1,5)
is  Way {len=7, pos=(4,5)}
here it is: [(7,4),(6,4),(5,4),(4,4),(4,5),(3,5),(2,5),(1,5)]
user wants path from (7,4) to (1,5)
shortest path from (7,4) to (1,5)
~2~6~10~12flooding done
shortest path from (7,4) to (1,5)
is  Way {len=7, pos=(4,5)}
here it is: [(7,4),(6,4),(5,4),(4,4),(4,5),(3,5),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (7,4) to (1,5)
user wants path from (7,4) to (1,5)
shortest path from (7,4) to (1,5)
~2~6~10~12flooding done
shortest path from (7,4) to (1,5)
is  Way {len=7, pos=(4,5)}
here it is: [(7,4),(6,4),(5,4),(4,4),(4,5),(3,5),(2,5),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
estors forked
first item: Just (1,1 Move W)
next item: Just (0,1 Move S)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 69
CPU time already used: 15530000000000 
 rounded to 15530 milliseconds 
 average:  225 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 432, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(6,4)),(666,(8,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 432, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(6,4)),(666,(8,5))]

fork suggestors ...
... suggestorsup sofesorsr ikwbealdne
t sc opmamtahn dfsr:o m[ ((06,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()6,,(40), 1t oM o(v1e, 5W))
,(0~,21 ~P6ic~k1)0,(f0l,o1o dDirnogp  d3o5n)e]

sfhiorrstte sitt epma:t hJ ufsrto m( 0(,61, 4M)o vteo  W()1
,5)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (6,4) to (1,5)
shortest path from (6,4) to (1,5)
~2~6~10flooding done
shortest path from (6,4) to (1,5)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (6,4) to (1,5)
shortest path from (6,4) to (1,5)
~2~6~10flooding done
shortest path from (6,4) to (1,5)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (6,4) to (1,5)
shortest path from (6,4) to (1,5)
~2~6~10flooding done
shortest path from (6,4) to (1,5)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (6,4) to (1,5)
shortest path from (6,4) to (1,5)
~2~6~10flooding done
shortest path from (6,4) to (1,5)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (6,4) to (1,5)
user wants path from (6,4) to (1,5)
shortest path from (6,4) to (1,5)
~2~6~10flooding done
shortest path from (6,4) to (1,5)
is  Way {len=6, pos=(3,4)}
here it is: [(6,4),(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 70
CPU time already used: 15550000000000 
 rounded to 15550 milliseconds 
 average:  222 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 431, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(5,4)),(666,(9,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 431, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(5,4)),(666,(9,5))]

fork suggestors ...
... suggestors forked
user wants path from (5,4) to (1,5)
shortest path from (5,4) to (1,5)
~2~6~10flooding done
shortest path from (5,4) to (1,5)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (5,4) to (1,5)
shortest path from (5,4) to (1,5)
~2~6~10flooding done
shortest path from (5,4) to (1,5)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (5,4) to (1,5)
shortest path from (5,4) to (1,5)
~2~6~10flooding done
shortest path from (5,4) to (1,5)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (5,4) to (1,5)
shortest path from (5,4) to (1,5)
~2~6~10flooding done
shortest path from (5,4) to (1,5)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
user wants path from (5,4) to (1,5)
shortest path from (5,4) to (1,5)
~2~6~10flooding done
shortest path from (5,4) to (1,5)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (5,4) to (1,5)
user wants path from (5,4) to (1,5)
shortest path from (5,4) to (1,5)
~2~6~10flooding done
shortest path from (5,4) to (1,5)
is  Way {len=5, pos=(3,4)}
here it is: [(5,4),(4,4),(3,4),(2,4),(1,4),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
first item: Just (1,1 Move W)
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
next item: Just (0,1 Move N)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 71
CPU time already used: 15570000000000 
 rounded to 15570 milliseconds 
 average:  219 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 430, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(4,4)),(666,(10,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 430, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(4,4)),(666,(10,5))]

fork suggestors ...
... suguser wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (4,4) to (1,5)
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
gestors forked
first item: Just (1,1 Move W)
next item: Just (0,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 72
CPU time already used: 15590000000000 
 rounded to 15590 milliseconds 
 average:  216 milliseconds per move.
<< #241 W #666 S
new info: id = 241, capacity = 10, money = 429, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(3,4)),(666,(10,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 429, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(3,4)),(666,(10,4))]

fork suggestors ...
... suggesuptsooesrrss i wbfalonert ksce odpm
amtahn dfsr:o m[ ((03,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()3,,(40), 1t oM o(v1e, 5W))
,(0~,21 ~P6icfkl)o,o(d0i,n1g  Ddroonpe 
35)s]h
ortfeisrts tp aitthe mf:r oJmu s(t3 ,(40), 1t oP i(c1k,)5
)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (3,4) to (1,5)
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 73
CPU time already used: 15610000000000 
 rounded to 15610 milliseconds 
 average:  213 milliseconds per move.
<< #241 W #666 S
new info: id = 241, capacity = 10, money = 428, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(2,4)),(666,(10,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 428, score = 4
packs = [(241,[35,36,37,38,39]),(666,[])]
poss = [(241,(2,4)),(666,(10,3))]

fork suggestors ...
... suggestuposoressrs  ifwboalrnekt escd o
pmamtahn dfsr:o m[ ((02,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()2,,(40), 1t oM o(v1e, 5W))
,(0~,21 fPliocokd)i,n(g0 ,d1o nDer
op s3h5o)r]t
estf iprastth  iftreomm:  (J2u,s4t)  (t0o, 1( 1D,r5o)p
 35i)s
  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (2,4) to (1,5)
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
suggested directions are [N]
***PATTI: the cmd is 1 Move N
next item: Just (1,1 Move N)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 74
CPU time already used: 15630000000000 
 rounded to 15630 milliseconds 
 average:  211 milliseconds per move.
<< #241 N #666 P 10 P 11 P 12 P 13 P 14
new info: id = 241, capacity = 10, money = 427, score = 4
packs = [(241,[35,36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,5)),(666,(10,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 427, score = 4
packs = [(241,[35,36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,5)),(666,(10,3))]

fork suggestors ...
..possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
. suggestors forked
first item: Just (0,1 Drop 35)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 35
number = 75
CPU time already used: 16460000000000 
 rounded to 16460 milliseconds 
 average:  219 milliseconds per move.
<< #241 D 35 #666 W
new info: id = 241, capacity = 10, money = 426, score = 4
packs = [(241,[36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,5)),(666,(9,3))]

<< 35 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 426, score = 4
packs = [(241,[36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,5)),(666,(9,3))]

fork suggestors ...
... suggpeosstsoirbsl ef ocrokmemda
nds: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 35),(0,1 Drop 36)]
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 76
CPU time already used: 16980000000000 
 rounded to 16980 milliseconds 
 average:  223 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 425, score = 4
packs = [(241,[36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,4)),(666,(8,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 425, score = 4
packs = [(241,[36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,4)),(666,(8,3))]

fork suggestors ...
... supusogesgrse iswbtalonert ssc  ofpmoamrtakhne ddfs
r:o m[ ((02,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()2,,(40), 1t oM o(v1e, 5W))
,(0~,21 fPliocokd)i,n(g0 ,d1o nDer
op s3h6o)r]t
estf iprastth  iftreomm:  (J2u,s4t)  (t0o, 1( 1M,o5v)e
 W)i
s  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (2,4) to (1,5)
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
suggested directions are [N]
***PATTI: the cmd is 1 Move N
next item: Just (1,1 Move N)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 77
CPU time already used: 17000000000000 
 rounded to 17000 milliseconds 
 average:  220 milliseconds per move.
<< #241 N #666 W
new info: id = 241, capacity = 10, money = 424, score = 4
packs = [(241,[36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,5)),(666,(7,3))]

<< 35 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 424, score = 4
packs = [(241,[36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,5)),(666,(7,3))]

fork suggestors ...
... supossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 35),(0,1 Drop 36)]
ggestors forked
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 78
CPU time already used: 17660000000000 
 rounded to 17660 milliseconds 
 average:  226 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 423, score = 4
packs = [(241,[36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(3,5)),(666,(6,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 423, score = 4
packs = [(241,[36,37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(3,5)),(666,(6,3))]

fork suggestors ...
... spuogsgseisbtloer sc ofmomraknedds
: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Drop 36)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 36
number = 79
CPU time already used: 18180000000000 
 rounded to 18180 milliseconds 
 average:  230 milliseconds per move.
<< #241 D 36 #666 W
new info: id = 241, capacity = 10, money = 422, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(3,5)),(666,(5,3))]

<< 36 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 422, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(3,5)),(666,(5,3))]

fork suggestors ...
... suggestors forpossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 36),(0,1 Drop 37)]
ked
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 80
CPU time already used: 18750000000000 
 rounded to 18750 milliseconds 
 average:  234 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 421, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(3,4)),(666,(4,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 421, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(3,4)),(666,(4,3))]

fork suggestors ...
... suggestors upfsooesrrsk iewbdal
net sc opmamtahn dfsr:o m[ ((03,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()3,,(40), 1t oM o(v1e, 5W))
,(0~,21 ~P6icfkl)o,o(d0i,n1g  Ddroonpe 
37)s]h
ortfeisrts tp aitthe mf:r oJmu s(t3 ,(40), 1t oD r(o1p, 53)7
)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (3,4) to (1,5)
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 81
CPU time already used: 18770000000000 
 rounded to 18770 milliseconds 
 average:  231 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 420, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,4)),(666,(3,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 420, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,4)),(666,(3,3))]

fork suggestors ...
... suupgsogeserss itwboalrnest  scf oopmramktaehnd d
fsr:o m[ ((02,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()2,,(40), 1t oM o(v1e, 5W))
,(0~,21 fPliocokd)i,n(g0 ,d1o nDer
op s3h7o)r]t
estf iprastth  iftreomm:  (J2u,s4t)  (t0o, 1( 1M,o5v)e
 E)i
s  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (2,4) to (1,5)
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
suggested directions are [N]
***PATTI: the cmd is 1 Move N
next item: Just (1,1 Move N)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 82
CPU time already used: 18790000000000 
 rounded to 18790 milliseconds 
 average:  229 milliseconds per move.
<< #241 N #666 W
new info: id = 241, capacity = 10, money = 419, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,5)),(666,(2,3))]

<< 35 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 419, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,5)),(666,(2,3))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 35),(0,1 Drop 37)]
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 83
CPU time already used: 19590000000000 
 rounded to 19590 milliseconds 
 average:  236 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 418, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,4)),(666,(1,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 418, score = 4
packs = [(241,[37,38,39]),(666,[10,11,12,13,14])]
poss = [(241,(2,4)),(666,(1,3))]

fork suggestors ...
... suggestors upfsooesrrsk iewbdal
net sc opmamtahn dfsr:o m[ ((02,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()2,,(40), 1t oM o(v1e, 5W))
,(0~,21 fPliocokd)i,n(g0 ,d1o nDer
op s3h7o)r]t
estf iprastth  iftreomm:  (J2u,s4t)  (t0o, 1( 1P,i5c)k
)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (2,4) to (1,5)
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
suggested directions are [N]
***PATTI: the cmd is 1 Move N
next item: Just (1,1 Move N)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 84
CPU time already used: 19610000000000 
 rounded to 19610 milliseconds 
 average:  233 milliseconds per move.
<< #241 N #666 D 14 D 13 D 12 D 11 D 10
new info: id = 241, capacity = 10, money = 417, score = 4
packs = [(241,[37,38,39]),(666,[])]
poss = [(241,(2,5)),(666,(1,3))]

<< 35 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 417, score = 4
packs = [(241,[37,38,39]),(666,[])]
poss = [(241,(2,5)),(666,(1,3))]

fork suggestors ...
... suggepossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 35),(0,1 Drop 37)]
stors forked
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 85
CPU time already used: 20430000000000 
 rounded to 20430 milliseconds 
 average:  240 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 416, score = 4
packs = [(241,[37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(2,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 416, score = 4
packs = [(241,[37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(2,3))]

fork suggestors ...
... s
Fail: choose: no destination given??
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop 37)]
uggestors forked
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 86
CPU time already used: 20430000000000 
 rounded to 20430 milliseconds 
 average:  237 milliseconds per move.
<< #241 S #666 P 17
new info: id = 241, capacity = 10, money = 415, score = 4
packs = [(241,[37,38,39]),(666,[17])]
poss = [(241,(1,4)),(666,(2,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 415, score = 4
packs = [(241,[37,38,39]),(666,[17])]
poss = [(241,(1,4)),(666,(2,3))]

fork suggestors ...
... suggestors forked
Fail: choose: no destination given??

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Pick 20 21 22 23 24 25 26 27 28 29),(0,1 Drop 37)]
first item: Just (0,1 Pick 20 21 22 23 24 25 26 27 28 29)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick 20 21 22 23 24 25 26 27 28 29
number = 87
CPU time already used: 20430000000000 
 rounded to 20430 milliseconds 
 average:  234 milliseconds per move.
<< #241           #666 E
new info: id = 241, capacity = 10, money = 414, score = 4
packs = [(241,[37,38,39]),(666,[17])]
poss = [(241,(1,4)),(666,(3,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 414, score = 4
packs = [(241,[37,38,39]),(666,[17])]
poss = [(241,(1,4)),(666,(3,3))]

fork suggestors ...
... suggestors forked

Fail: choose: no destination given??
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Pick 20 21 22 23 24 25 26 27 28 29),(0,1 Drop 37)]
first item: Just (0,1 Pick 20 21 22 23 24 25 26 27 28 29)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick 20 21 22 23 24 25 26 27 28 29
number = 88
CPU time already used: 20440000000000 
 rounded to 20440 milliseconds 
 average:  232 milliseconds per move.
<< #241           #666 P 16
new info: id = 241, capacity = 10, money = 413, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(1,4)),(666,(3,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 413, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(1,4)),(666,(3,3))]

fork suggestors ...
... suggestors forked

Fail: choose: no destination given??
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Pick 20 21 22 23 24 25 26 27 28 29),(0,1 Drop 37)]
first item: Just (0,1 Move N)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 89
CPU time already used: 20440000000000 
 rounded to 20440 milliseconds 
 average:  229 milliseconds per move.
<< #241 N #666 E
new info: id = 241, capacity = 10, money = 412, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(1,5)),(666,(4,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 412, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(1,5)),(666,(4,3))]

fork suggestors ...
.
Fail: choose: no destination given??
..p ossusgigbelset ocrosm mfaonrdkse:d 
[(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop 37)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 90
CPU time already used: 20440000000000 
 rounded to 20440 milliseconds 
 average:  227 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 411, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(2,5)),(666,(5,3))]

<< 35 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 411, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(2,5)),(666,(5,3))]

fork suggestors ...
...possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 35),(0,1 Drop 37)]
 suggestors forked
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 91
CPU time already used: 21330000000000 
 rounded to 21330 milliseconds 
 average:  234 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 410, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(1,5)),(666,(6,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 410, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(1,5)),(666,(6,3))]

fork suggestors ...
... suggestors 
Fail: choose: no destination given??
foproksesdi
ble commands: [(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop 37)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 92
CPU time already used: 21350000000000 
 rounded to 21350 milliseconds 
 average:  232 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 409, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(2,5)),(666,(7,3))]

<< 35 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 409, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(2,5)),(666,(7,3))]

fork suggestors ...
... suggestors fpoorskseidb
le commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 35),(0,1 Drop 37)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 93
CPU time already used: 22230000000000 
 rounded to 22230 milliseconds 
 average:  239 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 408, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(3,5)),(666,(8,3))]

<< 36 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 408, score = 4
packs = [(241,[37,38,39]),(666,[16,17])]
poss = [(241,(3,5)),(666,(8,3))]

fork suggestors ...
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 36),(0,1 Drop 37)]
... suggestors forked
first item: Just (0,1 Pick 36)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick 36
number = 94
CPU time already used: 22810000000000 
 rounded to 22810 milliseconds 
 average:  242 milliseconds per move.
<< #241 P 36 #666 E
new info: id = 241, capacity = 10, money = 407, score = 4
packs = [(241,[36,37,38,39]),(666,[16,17])]
poss = [(241,(3,5)),(666,(9,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 407, score = 4
packs = [(241,[36,37,38,39]),(666,[16,17])]
poss = [(241,(3,5)),(666,(9,3))]

fork suggestors ...
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
... suggestors forked
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 95
CPU time already used: 23390000000000 
 rounded to 23390 milliseconds 
 average:  246 milliseconds per move.
<< #241 E #666 P 15
new info: id = 241, capacity = 10, money = 406, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(9,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 406, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(9,3))]

fork suggestors ...
... suggestors forkedpossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]

first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 96
CPU time already used: 23880000000000 
 rounded to 23880 milliseconds 
 average:  248 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 405, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(10,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 405, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(10,3))]

fork suggestors ...
...possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
 suggestors forked
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 97
CPU time already used: 24450000000000 
 rounded to 24450 milliseconds 
 average:  252 milliseconds per move.
<< #241 W #666 N
new info: id = 241, capacity = 10, money = 404, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(3,5)),(666,(10,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 404, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(3,5)),(666,(10,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 98
CPU time already used: 24930000000000 
 rounded to 24930 milliseconds 
 average:  254 milliseconds per move.
<< #241 E #666 N
new info: id = 241, capacity = 10, money = 403, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(10,5))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 403, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(10,5))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 99
CPU time already used: 25500000000000 
 rounded to 25500 milliseconds 
 average:  257 milliseconds per move.
<< #241 W #666 S
new info: id = 241, capacity = 10, money = 402, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(3,5)),(666,(10,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 402, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(3,5)),(666,(10,4))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 100
CPU time already used: 25980000000000 
 rounded to 25980 milliseconds 
 average:  259 milliseconds per move.
<< #241 E #666 S
new info: id = 241, capacity = 10, money = 401, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(10,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 401, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(10,3))]

fork suggestors ...
... suggestors forkedp
ossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 101
CPU time already used: 26550000000000 
 rounded to 26550 milliseconds 
 average:  262 milliseconds per move.
<< #241 W #666 S
new info: id = 241, capacity = 10, money = 400, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(3,5)),(666,(10,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 400, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(3,5)),(666,(10,2))]

fork suggestors ...
... suggestors forkedp
ossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 102
CPU time already used: 27130000000000 
 rounded to 27130 milliseconds 
 average:  265 milliseconds per move.
<< #241 E #666 P 0 P 1
new info: id = 241, capacity = 10, money = 399, score = 4
packs = [(241,[36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(4,5)),(666,(10,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 399, score = 4
packs = [(241,[36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(4,5)),(666,(10,2))]

fork suggestors ...
... supgogsessitbolres  cfoomrmkaendd
s: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 103
CPU time already used: 27630000000000 
 rounded to 27630 milliseconds 
 average:  268 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 398, score = 4
packs = [(241,[36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(3,5)),(666,(9,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 398, score = 4
packs = [(241,[36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(3,5)),(666,(9,2))]

fork suggestors ...
... suggesptoosrssi bfloer kceodm
mands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 104
CPU time already used: 28180000000000 
 rounded to 28180 milliseconds 
 average:  270 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 397, score = 4
packs = [(241,[36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(3,5)),(666,(8,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 397, score = 4
packs = [(241,[36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(3,5)),(666,(8,2))]

fork suggestors ...
... suggestors forkpeods
sible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 105
CPU time already used: 28680000000000 
 rounded to 28680 milliseconds 
 average:  273 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 396, score = 4
packs = [(241,[36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(2,5)),(666,(7,2))]

<< 35 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 396, score = 4
packs = [(241,[36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(2,5)),(666,(7,2))]

fork suggestors ...
... suggestors forkepossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 35),(0,1 Drop 36)]
d
first item: Just (0,1 Pick 35)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick 35
number = 106
CPU time already used: 29240000000000 
 rounded to 29240 milliseconds 
 average:  275 milliseconds per move.
<< #241 P 35 #666 W
new info: id = 241, capacity = 10, money = 395, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(2,5)),(666,(6,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 395, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(2,5)),(666,(6,2))]

fork suggestors ...
... suggestors forked
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 107
CPU time already used: 29840000000000 
 rounded to 29840 milliseconds 
 average:  278 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 394, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(3,5)),(666,(5,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 394, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(3,5)),(666,(5,2))]

fork suggestors ...
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
... suggestors forked
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 108
CPU time already used: 30330000000000 
 rounded to 30330 milliseconds 
 average:  280 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 393, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(3,5)),(666,(4,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 393, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(3,5)),(666,(4,2))]

fork suggestors ...
... suggpossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
estors forked
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 109
CPU time already used: 30910000000000 
 rounded to 30910 milliseconds 
 average:  283 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 392, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(4,5)),(666,(3,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 392, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(4,5)),(666,(3,2))]

fork suggestors ...
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
... suggestors forked
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 110
CPU time already used: 31380000000000 
 rounded to 31380 milliseconds 
 average:  285 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 391, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(4,5)),(666,(2,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 391, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(4,5)),(666,(2,2))]

fork suggestors ...
... suggpossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
estors forked
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 111
CPU time already used: 31950000000000 
 rounded to 31950 milliseconds 
 average:  287 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 390, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(4,5)),(666,(1,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 390, score = 4
packs = [(241,[35,36,37,38,39]),(666,[0,1,15,16,17])]
poss = [(241,(4,5)),(666,(1,2))]

fork suggestors ...
... suggepsotsosrisb lfeo rckoemdm
ands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 35)]
first item: Just (0,1 Drop 35)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 35
number = 112
CPU time already used: 32430000000000 
 rounded to 32430 milliseconds 
 average:  289 milliseconds per move.
<< #241 D 35 #666 D 1 D 0
new info: id = 241, capacity = 10, money = 389, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(1,2))]

<< 35 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 389, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,5)),(666,(1,2))]

fork suggestors ...
... suggepossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 35),(0,1 Drop 36)]
stors forked
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 113
CPU time already used: 33000000000000 
 rounded to 33000 milliseconds 
 average:  292 milliseconds per move.
<< #241 S #666 N
new info: id = 241, capacity = 10, money = 388, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,4)),(666,(1,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 388, score = 4
packs = [(241,[36,37,38,39]),(666,[15,16,17])]
poss = [(241,(4,4)),(666,(1,3))]

fork suggestors ...
... suggestors forked
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (4,4) to (1,5)
user wants path from (4,4) to (1,5)
shortest path from (4,4) to (1,5)
~2~6flooding done
shortest path from (4,4) to (1,5)
is  Way {len=4, pos=(3,5)}
here it is: [(4,4),(3,4),(3,5),(2,5),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (1,1 Move W)
next item: Just (0,1 Pick)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 114
CPU time already used: 33020000000000 
 rounded to 33020 milliseconds 
 average:  289 milliseconds per move.
<< #241 W #666 D 15 D 16 D 17
new info: id = 241, capacity = 10, money = 387, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(3,4)),(666,(1,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 387, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(3,4)),(666,(1,3))]

fork suggestors ...
... sugupgsoeessrst iowbralsne t fsco orpmkametadhn
 dfsr:o m[ ((03,,14 )M otvoe  (N1),,5()0
,1 sMhoovret eSs)t, (p0a,t1h  Mforvoem  E()3,,(40), 1t oM o(v1e, 5W))
,(0~,21 ~P6icfkl)o,o(d0i,n1g  Ddroonpe 
36)s]h
ortfeisrts tp aitthe mf:r oJmu s(t3 ,(40), 1t oM o(v1e, 5W))

is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (3,4) to (1,5)
user wants path from (3,4) to (1,5)
shortest path from (3,4) to (1,5)
~2~6flooding done
shortest path from (3,4) to (1,5)
is  Way {len=3, pos=(2,5)}
here it is: [(3,4),(2,4),(2,5),(1,5)]
suggested directions are [W]
***PATTI: the cmd is 1 Move W
next item: Just (1,1 Move W)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 115
CPU time already used: 33030000000000 
 rounded to 33030 milliseconds 
 average:  287 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 386, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(2,4)),(666,(2,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 386, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(2,4)),(666,(2,3))]

fork suggestors ...
... suggestoruser wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
***PATTI: goto dest: (1,5)
user wants direction from (2,4) to (1,5)
user wants path from (2,4) to (1,5)
shortest path from (2,4) to (1,5)
~2flooding done
shortest path from (2,4) to (1,5)
is  Way {len=2, pos=(2,5)}
here it is: [(2,4),(2,5),(1,5)]
suggested directions are [N]
***PATTI: the cmd is 1 Move N
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
s forked
first item: Just (1,1 Move N)
next item: Just (0,1 Pick)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 116
CPU time already used: 33050000000000 
 rounded to 33050 milliseconds 
 average:  284 milliseconds per move.
<< #241 N #666 S
new info: id = 241, capacity = 10, money = 385, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(2,5)),(666,(2,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 385, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(2,5)),(666,(2,2))]

fork suggestors ...
...possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
 suggestors forked
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 117
CPU time already used: 33930000000000 
 rounded to 33930 milliseconds 
 average:  290 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 384, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(3,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 384, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(3,2))]

fork suggestors ...
... suggestors forke
Fail: choose: no destination given??
d
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop 36)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 118
CPU time already used: 33940000000000 
 rounded to 33940 milliseconds 
 average:  287 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 383, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(2,5)),(666,(4,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 383, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(2,5)),(666,(4,2))]

fork suggestors ...
... suggestors forpkoesds
ible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 36)]
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 119
CPU time already used: 34830000000000 
 rounded to 34830 milliseconds 
 average:  292 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 382, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(5,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 382, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(5,2))]

fork suggestors ...
... suggestors forke
Fail: choose: no destination given??
d
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop 36)]
first item: Just (0,1 Pick 30 31 32 33 34)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick 30 31 32 33 34
number = 120
CPU time already used: 34840000000000 
 rounded to 34840 milliseconds 
 average:  290 milliseconds per move.
<< #241      #666 E
new info: id = 241, capacity = 10, money = 381, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(6,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 381, score = 4
packs = [(241,[36,37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(6,2))]

fork suggestors ...
... s
Fail: choose: no destination given??
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop 36)]
uggestors forked
first item: Just (0,1 Drop 36)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 36
number = 121
CPU time already used: 34860000000000 
 rounded to 34860 milliseconds 
 average:  288 milliseconds per move.
<< #241 D 36 #666 E
new info: id = 241, capacity = 10, money = 380, score = 6
packs = [(241,[37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(7,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 380, score = 6
packs = [(241,[37,38,39]),(666,[])]
poss = [(241,(1,5)),(666,(7,2))]

fork suggestors ...
.
Fail: choose: no destination given??
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop 37)]
.. suggestors forked
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 122
CPU time already used: 34880000000000 
 rounded to 34880 milliseconds 
 average:  285 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 379, score = 6
packs = [(241,[37,38,39]),(666,[])]
poss = [(241,(2,5)),(666,(8,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 379, score = 6
packs = [(241,[37,38,39]),(666,[])]
poss = [(241,(2,5)),(666,(8,2))]

fork suggestors ...
... spossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop 37)]
uggestors forked
first item: Just (0,1 Drop 37)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 37
number = 123
CPU time already used: 35740000000000 
 rounded to 35740 milliseconds 
 average:  290 milliseconds per move.
<< #241 D 37 #666 E
new info: id = 241, capacity = 10, money = 378, score = 6
packs = [(241,[38,39]),(666,[])]
poss = [(241,(2,5)),(666,(9,2))]

<< 37 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 378, score = 6
packs = [(241,[38,39]),(666,[])]
poss = [(241,(2,5)),(666,(9,2))]

fork suggestors ...
... suggestors forkpossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 37),(0,1 Drop 38)]
ed
first item: Just (0,1 Drop 38)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 38
number = 124
CPU time already used: 36310000000000 
 rounded to 36310 milliseconds 
 average:  292 milliseconds per move.
<< #241 D 38 #666 E
new info: id = 241, capacity = 10, money = 377, score = 6
packs = [(241,[39]),(666,[])]
poss = [(241,(2,5)),(666,(10,2))]

<< 38 1 5 2 37 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 377, score = 6
packs = [(241,[39]),(666,[])]
poss = [(241,(2,5)),(666,(10,2))]

fork suggestors ...
... suggestpossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 37 38),(0,1 Drop 39)]
ors forked
first item: Just (0,1 Drop 39)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop 39
number = 125
CPU time already used: 36780000000000 
 rounded to 36780 milliseconds 
 average:  294 milliseconds per move.
<< #241 D 39 #666 P 2 P 3 P 4 P 5 P 6
new info: id = 241, capacity = 10, money = 376, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(2,5)),(666,(10,2))]

<< 39 1 5 2 38 1 5 2 37 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 376, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(2,5)),(666,(10,2))]

fork suggestors ...
... suggestorspossible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 37 38 39),(0,1 Drop)]
 forked
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 126
CPU time already used: 37370000000000 
 rounded to 37370 milliseconds 
 average:  296 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 375, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(1,5)),(666,(9,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 375, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(1,5)),(666,(9,2))]

fork suggestors ...

Fail: choose: no destination given??
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop)]
... suggestors forked
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 127
CPU time already used: 37380000000000 
 rounded to 37380 milliseconds 
 average:  294 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 374, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(2,5)),(666,(8,2))]

<< 39 1 5 2 38 1 5 2 37 1 5 2
new info (pack_update): id = 241, capacity = 10, money = 374, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(2,5)),(666,(8,2))]

fork suggestors ...
... suggepsotsosrisb lfeo rckoemdm
ands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick 37 38 39),(0,1 Drop)]
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 128
CPU time already used: 37970000000000 
 rounded to 37970 milliseconds 
 average:  296 milliseconds per move.
<< #241 W #666 W
new info: id = 241, capacity = 10, money = 373, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(1,5)),(666,(7,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 373, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(1,5)),(666,(7,2))]

fork suggestors ...

Fail: choose: no destination given??
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Pick 30 31 32 33 34),(0,1 Drop)]
... suggestors forked
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 129
CPU time already used: 37980000000000 
 rounded to 37980 milliseconds 
 average:  294 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 372, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(1,4)),(666,(6,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 372, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(1,4)),(666,(6,2))]

fork suggestors ...
..
Fail: choose: no destination given??
. psousgsgiebslteo rcso mfmoarnkdesd:
 [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Pick 20 21 22 23 24 25 26 27 28 29),(0,1 Drop)]
first item: Just (0,1 Drop)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 130
CPU time already used: 38000000000000 
 rounded to 38000 milliseconds 
 average:  292 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 371, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(1,4)),(666,(5,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 371, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(1,4)),(666,(5,2))]

fork suggestors ...
... 
Fail: choose: no destination given??
supgogsessitbolres  cfoomrmkaendd
s: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Pick 20 21 22 23 24 25 26 27 28 29),(0,1 Drop)]
first item: Just (0,1 Move E)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 131
CPU time already used: 38020000000000 
 rounded to 38020 milliseconds 
 average:  290 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 370, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(2,4)),(666,(4,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 370, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(2,4)),(666,(4,2))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,4)
user wants direction from (2,4) to (10,4)
user wants path from (2,4) to (10,4)
shortest path from (2,4) to (10,4)
~2~7~10~9flooding done
shortest path from (2,4) to (10,4)
is  Way {len=8, pos=(6,4)}
here it is: [(2,4),(3,4),(4,4),(5,4),(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
first item: Just (1,1 Move E)
next item: Just (0,1 Move S)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 132
CPU time already used: 38040000000000 
 rounded to 38040 milliseconds 
 average:  288 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 369, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(3,4)),(666,(3,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 369, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(3,4)),(666,(3,2))]

fork suggestors ...
... suggestors forked
*p*o*sPsAiTbTlIe:  cgoomtmoa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E3),,4()0 ,t1o  M(o1v0e, 4W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(3,f4i)r stto  i(t1e0m,:4 )J
usts h(o0r,t1e sPti cpka)t
h from (3,4) to (10,4)
~2~7~11~11flooding done
shortest path from (3,4) to (10,4)
is  Way {len=7, pos=(7,4)}
here it is: [(3,4),(4,4),(5,4),(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 133
CPU time already used: 38060000000000 
 rounded to 38060 milliseconds 
 average:  286 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 368, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(4,4)),(666,(2,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 368, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(4,4)),(666,(2,2))]

fork suggestors ...
***PATTI: goto home: (10,4)
user wants direction from (4,4) to (10,4)
user wants path from (4,4) to (10,4)
shortest path from (4,4) to (10,4)
~2~7~11flooding done
shortest path from (4,4) to (10,4)
is  Way {len=6, pos=(7,4)}
here it is: [(4,4),(5,4),(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
... suggestors forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move N)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 134
CPU time already used: 38080000000000 
 rounded to 38080 milliseconds 
 average:  284 milliseconds per move.
<< #241 E #666 W
new info: id = 241, capacity = 10, money = 367, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(5,4)),(666,(1,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 367, score = 6
packs = [(241,[]),(666,[2,3,4,5,6])]
poss = [(241,(5,4)),(666,(1,2))]

fork suggestors ...
... *ps*ou*sgPsgAieTbsTltIeo: r csgo omftmooar nkhdeosdm:
e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E5),,4()0 ,t1o  M(o1v0e, 4W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(5,f4i)r stto  i(t1e0m,:4 )J
usts h(o0r,t1e sMto vpea tWh) 
from (5,4) to (10,4)
~2~7~11flooding done
shortest path from (5,4) to (10,4)
is  Way {len=5, pos=(7,4)}
here it is: [(5,4),(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 135
CPU time already used: 38100000000000 
 rounded to 38100 milliseconds 
 average:  282 milliseconds per move.
<< #241 E #666 D 6 D 5 D 4 D 3 D 2
new info: id = 241, capacity = 10, money = 366, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(6,4)),(666,(1,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 366, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(6,4)),(666,(1,2))]

fork suggestors ...
... suggestors fo*pr*ok*sePsdAi
TbTlIe:  cgoomtmoa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E6),,4()0 ,t1o  M(o1v0e, 4W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(6,f4i)r stto  i(t1e0m,:4 )J
usts h(o0r,t1e sMto vpea tEh) 
from (6,4) to (10,4)
~2~7flooding done
shortest path from (6,4) to (10,4)
is  Way {len=4, pos=(8,4)}
here it is: [(6,4),(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 136
CPU time already used: 38120000000000 
 rounded to 38120 milliseconds 
 average:  280 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 365, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(7,4)),(666,(2,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 365, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(7,4)),(666,(2,2))]

fork suggestors ...
... sugge*ps*ot*soPsrAisTb TlfIeo: r ckgoeomdtm
oa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E7),,4()0 ,t1o  M(o1v0e, 4W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(7,f4i)r stto  i(t1e0m,:4 )J
usts h(o0r,t1e sPti cpka)t
h from (7,4) to (10,4)
~2~7flooding done
shortest path from (7,4) to (10,4)
is  Way {len=3, pos=(9,4)}
here it is: [(7,4),(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 137
CPU time already used: 38130000000000 
 rounded to 38130 milliseconds 
 average:  278 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 364, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(8,4)),(666,(3,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 364, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(8,4)),(666,(3,2))]

fork suggestors ...
... suggestors for*pk*oe*sdPs
AiTbTlIe:  cgoomtmoa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E8),,4()0 ,t1o  M(o1v0e, 4W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(8,f4i)r stto  i(t1e0m,:4 )J
usts h(o0r,t1e sPti cpka)t
h from (8,4) to (10,4)
~2flooding done
shortest path from (8,4) to (10,4)
is  Way {len=2, pos=(9,4)}
here it is: [(8,4),(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 138
CPU time already used: 38140000000000 
 rounded to 38140 milliseconds 
 average:  276 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 363, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(9,4)),(666,(4,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 363, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(9,4)),(666,(4,2))]

fork suggestors ...
... suggestors*p *of*soPsrAikTbeTldIe
:  cgoomtmoa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E9),,4()0 ,t1o  M(o1v0e, 4W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(9,f4i)r stto  i(t1e0m,:4 )J
usts h(o0r,t1e sMto vpea tNh) 
from (9,4) to (10,4)
~2flooding done
shortest path from (9,4) to (10,4)
is  Way {len=1, pos=(9,4)}
here it is: [(9,4),(10,4)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 139
CPU time already used: 38160000000000 
 rounded to 38160 milliseconds 
 average:  274 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 362, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(5,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 362, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(5,2))]

fork suggestors ...
... suggestors f*po*or*skPseAidTb
TlIe:  cgoomtmoa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(40), 1t oP i(c1k0),,4()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t4 )( 0t,o1  (D1r0o,p4))

shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 140
CPU time already used: 38180000000000 
 rounded to 38180 milliseconds 
 average:  272 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 361, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(6,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 361, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(6,2))]

fork suggestors ...
... su*pg*og*sePssAitTboTlrIes:   cfgooomrtmkoae ndhd
osm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(40), 1t oP i(c1k0),,4()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t4 )( 0t,o1  (D1r0o,p4))

shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 141
CPU time already used: 38200000000000 
 rounded to 38200 milliseconds 
 average:  270 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 360, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(7,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 360, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(7,2))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,4)
user wants direction from (10,4) to (10,4)
user wants path from (10,4) to (10,4)
shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 142
CPU time already used: 38220000000000 
 rounded to 38220 milliseconds 
 average:  269 milliseconds per move.
<< #241 S #666 E
new info: id = 241, capacity = 10, money = 359, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,3)),(666,(8,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 359, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,3)),(666,(8,2))]

fork suggestors ...
... su*pg*og*sePssAitTboTlrIes:   cfgooomrtmkoae ndhd
osm:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(30), 1t oP i(c1k0),,3()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t3 )( 0t,o1  (P1i0c,k3))

shortest path from (10,3) to (10,3)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,3) to (10,3)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 143
CPU time already used: 38240000000000 
 rounded to 38240 milliseconds 
 average:  267 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 358, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,3)),(666,(9,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 358, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,3)),(666,(9,2))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,3)
user wants direction from (10,3) to (10,3)
user wants path from (10,3) to (10,3)
shortest path from (10,3) to (10,3)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,3) to (10,3)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
first item: Just (0,1 Drop)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 144
CPU time already used: 38260000000000 
 rounded to 38260 milliseconds 
 average:  265 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 357, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,3)),(666,(10,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 357, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,3)),(666,(10,2))]

fork suggestors ...
... suggest*po*or*ssPs AifTboTlrIek: e cdgo
omtmoa nhdosm:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(30), 1t oP i(c1k0),,3()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t3 )( 0t,o1  (D1r0o,p3))

shortest path from (10,3) to (10,3)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,3) to (10,3)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 145
CPU time already used: 38280000000000 
 rounded to 38280 milliseconds 
 average:  264 milliseconds per move.
<< #241 #666 P 7 P 8 P 9
new info: id = 241, capacity = 10, money = 356, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,3)),(666,(10,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 356, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,3)),(666,(10,2))]

fork suggestors ...
... s*pu*og*sgPseAisTbtTloIer: s c gofomotmroak nehddos
m:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(30), 1t oP i(c1k0),,3()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t3 )( 0t,o1  (M1o0v,e3 )S
)
shortest path from (10,3) to (10,3)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,3) to (10,3)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 146
CPU time already used: 38290000000000 
 rounded to 38290 milliseconds 
 average:  262 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 355, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(9,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 355, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(9,2))]

fork suggestors ...
... suggesto*pr*os*s PsfAioTbrTlkIee: d c
goomtmoa nhdosm:e :[ ((01,01, 2M)o
ve uNs)e,r( 0w,a1n tMso vdei rWe)c,t(i0o,n1  fPriocmk )(,1(00,,21)  Dtroo p()1]0
,2)
user wants path from (10,2) to (10,2)
shortest path from (10,2) to (10,2)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,2) to (10,2)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

first item: Just (0,1 Drop)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 147
CPU time already used: 38310000000000 
 rounded to 38310 milliseconds 
 average:  260 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 354, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(8,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 354, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(8,2))]

fork suggestors ...
... suggestors forked
*p*o*sPsAiTbTlIe:  cgoomtmoa nhdosm:e :[ ((01,01, 2M)o
ve uNs)e,r( 0w,a1n tMso vdei rWe)c,t(i0o,n1  fPriocmk )(,1(00,,21)  Dtroo p()1]0
,2)f
irsuts eirt ewma:n tJsu spta t(h0 ,f1r oDmr o(p1)0
,2) to (10,2)
shortest path from (10,2) to (10,2)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,2) to (10,2)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 148
CPU time already used: 38330000000000 
 rounded to 38330 milliseconds 
 average:  258 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 353, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(7,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 353, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(7,2))]

fork suggestors ...
... sugge*ps*ot*soPsrAisTb TlfIeo: r ckgoeomdtm
oa nhdosm:e :[ ((01,01, 2M)o
ve uNs)e,r( 0w,a1n tMso vdei rWe)c,t(i0o,n1  fPriocmk )(,1(00,,21)  Dtroo p()1]0
,2)f
irsuts eirt ewma:n tJsu spta t(h0 ,f1r oPmi c(k1)0
,2) to (10,2)
shortest path from (10,2) to (10,2)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,2) to (10,2)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 149
CPU time already used: 38350000000000 
 rounded to 38350 milliseconds 
 average:  257 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 352, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(6,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 352, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(6,2))]

fork suggestors ...
... suggestors fork***PATTI: goto home: (10,2)
user wants direction from (10,2) to (10,2)
user wants path from (10,2) to (10,2)
shortest path from (10,2) to (10,2)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,2) to (10,2)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
ed
first item: Just (0,1 Drop)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Drop
number = 150
CPU time already used: 38370000000000 
 rounded to 38370 milliseconds 
 average:  255 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 351, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(5,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 351, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(5,2))]

fork suggestors ...
... *ps*ou*sgPsgAieTbsTltIeo: r csgo omftmooar nkhdeosdm:
e :[ ((01,01, 2M)o
ve uNs)e,r( 0w,a1n tMso vdei rWe)c,t(i0o,n1  fPriocmk )(,1(00,,21)  Dtroo p()1]0
,2)f
irsuts eirt ewma:n tJsu spta t(h0 ,f1r oPmi c(k1)0
,2) to (10,2)
shortest path from (10,2) to (10,2)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,2) to (10,2)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 151
CPU time already used: 38390000000000 
 rounded to 38390 milliseconds 
 average:  254 milliseconds per move.
<< #241 #666 W
new info: id = 241, capacity = 10, money = 350, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(4,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 350, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,2)),(666,(4,2))]

fork suggestors ...
... suggestors f*po*or*skPseAidTb
TlIe:  cgoomtmoa nhdosm:e :[ ((01,01, 2M)o
ve uNs)e,r( 0w,a1n tMso vdei rWe)c,t(i0o,n1  fPriocmk )(,1(00,,21)  Dtroo p()1]0
,2)f
irsuts eirt ewma:n tJsu spta t(h0 ,f1r oMmo v(e1 0N,)2
) to (10,2)
shortest path from (10,2) to (10,2)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,2) to (10,2)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 152
CPU time already used: 38410000000000 
 rounded to 38410 milliseconds 
 average:  252 milliseconds per move.
<< #241 N #666 W
new info: id = 241, capacity = 10, money = 349, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,3)),(666,(3,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 349, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,3)),(666,(3,2))]

fork suggestors ...
... suggestors***PATTI: goto home: (10,3)
user wants direction from (10,3) to (10,3)
user wants path from (10,3) to (10,3)
shortest path from (10,3) to (10,3)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,3) to (10,3)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
 forked
first item: Just (0,1 Move N)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 153
CPU time already used: 38420000000000 
 rounded to 38420 milliseconds 
 average:  251 milliseconds per move.
<< #241 N #666 W
new info: id = 241, capacity = 10, money = 348, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,4)),(666,(2,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 348, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,4)),(666,(2,2))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,4)
user wants direction from (10,4) to (10,4)
user wants path from (10,4) to (10,4)
shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 154
CPU time already used: 38440000000000 
 rounded to 38440 milliseconds 
 average:  249 milliseconds per move.
<< #241 S #666 W
new info: id = 241, capacity = 10, money = 347, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,3)),(666,(1,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 347, score = 6
packs = [(241,[]),(666,[7,8,9])]
poss = [(241,(10,3)),(666,(1,2))]

fork suggestors ...
... suggesto*pr*os*s PsfAioTbrTlkIee: d c
goomtmoa nhdosm:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(30), 1t oP i(c1k0),,3()0
,1 uDsreorp )w]a
nts path from (10,3) to (10,3)
shortest path from (10,3) to (10,3)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,3) to (10,3)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 155
CPU time already used: 38450000000000 
 rounded to 38450 milliseconds 
 average:  248 milliseconds per move.
<< #241 W #666 D 9 D 8 D 7
new info: id = 241, capacity = 10, money = 346, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(9,3)),(666,(1,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 346, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(9,3)),(666,(1,2))]

fork suggestors ...
... su*pg*og*sePssAitTboTlrIes:   cfgooomrtmkoae ndhd
osm:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (E9),,3()0 ,t1o  M(o1v0e, 3W))
,(0u,s1e rP iwcakn)t,s( 0p,a1t hD rforpo)m] 
(9,f3i)r stto  i(t1e0m,:3 )J
usts h(o0r,t1e sDtr oppa)t
h from (9,3) to (10,3)
~2flooding done
shortest path from (9,3) to (10,3)
is  Way {len=1, pos=(9,3)}
here it is: [(9,3),(10,3)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
next item: Just (1,1 Move E)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 156
CPU time already used: 38460000000000 
 rounded to 38460 milliseconds 
 average:  246 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 345, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,3)),(666,(2,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 345, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,3)),(666,(2,2))]

fork suggestors ...
... sugg*pe*os*stPsoAirTbsTl Ief: o crgokometmdoa
 nhdosm:e :[ ((01,01, 3M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(30), 1t oP i(c1k0),,3()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t3 )( 0t,o1  (M1o0v,e3 )N
)
shortest path from (10,3) to (10,3)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,3) to (10,3)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 157
CPU time already used: 38480000000000 
 rounded to 38480 milliseconds 
 average:  245 milliseconds per move.
<< #241 N #666 E
new info: id = 241, capacity = 10, money = 344, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(3,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 344, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(3,2))]

fork suggestors ...
... sugges***PATTI: goto home: (10,4)
user wants direction from (10,4) to (10,4)
user wants path from (10,4) to (10,4)
shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
tors forked
first item: Just (0,1 Move N)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 158
CPU time already used: 38490000000000 
 rounded to 38490 milliseconds 
 average:  243 milliseconds per move.
<< #241 N #666 E
new info: id = 241, capacity = 10, money = 343, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(4,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 343, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(4,2))]

fork suggestors ...
... suggestors***PATTI: goto home: (10,5)
user wants direction from (10,5) to (10,5)
user wants path from (10,5) to (10,5)
shortest path from (10,5) to (10,5)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,5) to (10,5)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
 forked
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 159
CPU time already used: 38500000000000 
 rounded to 38500 milliseconds 
 average:  242 milliseconds per move.
<< #241 S #666 E
new info: id = 241, capacity = 10, money = 342, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(5,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 342, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(5,2))]

fork suggestors ...
... su***PATTI: goto home: (10,4)
user wants direction from (10,4) to (10,4)
user wants path from (10,4) to (10,4)
shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move N),(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
ggestors forked
first item: Just (0,1 Move N)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move N
number = 160
CPU time already used: 38510000000000 
 rounded to 38510 milliseconds 
 average:  240 milliseconds per move.
<< #241 N #666 E
new info: id = 241, capacity = 10, money = 341, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(6,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 341, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(6,2))]

fork suggestors ...
... suggest***PATTI: goto home: (10,5)
user wants direction from (10,5) to (10,5)
user wants path from (10,5) to (10,5)
shortest path from (10,5) to (10,5)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,5) to (10,5)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
ors forked
first item: Just (0,1 Move W)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 161
CPU time already used: 38520000000000 
 rounded to 38520 milliseconds 
 average:  239 milliseconds per move.
<< #241 W #666 E
new info: id = 241, capacity = 10, money = 340, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(9,5)),(666,(7,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 340, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(9,5)),(666,(7,2))]

fork suggestors ...
... s***PATTI: goto home: (10,5)
user wants direction from (9,5) to (10,5)
user wants path from (9,5) to (10,5)
shortest path from (9,5) to (10,5)
~2flooding done
shortest path from (9,5) to (10,5)
is  Way {len=1, pos=(9,5)}
here it is: [(9,5),(10,5)]
suggested directions are [E]
***PATTI: the cmd is 1 Move E
possible commands: [(0,1 Move S),(0,1 Move E),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
uggestors forked
first item: Just (1,1 Move E)
next item: Just (0,1 Move S)
this NOT max_value, continue
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move E
number = 162
CPU time already used: 38530000000000 
 rounded to 38530 milliseconds 
 average:  237 milliseconds per move.
<< #241 E #666 E
new info: id = 241, capacity = 10, money = 339, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(8,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 339, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(8,2))]

fork suggestors ...
... suggestors forked
***PATTI: goto home: (10,5)
user wants direction from (10,5) to (10,5)
user wants path from (10,5) to (10,5)
shortest path from (10,5) to (10,5)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,5) to (10,5)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 163
CPU time already used: 38540000000000 
 rounded to 38540 milliseconds 
 average:  236 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 338, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(9,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 338, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(9,2))]

fork suggestors ...
***PATTI: goto home: (10,5)
user wants direction from (10,5) to (10,5)
user wants path from (10,5) to (10,5)
shortest path from (10,5) to (10,5)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,5) to (10,5)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
... suggestors forked
first item: Just (0,1 Pick)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Pick
number = 164
CPU time already used: 38550000000000 
 rounded to 38550 milliseconds 
 average:  235 milliseconds per move.
<< #241 #666 E
new info: id = 241, capacity = 10, money = 337, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(10,2))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 337, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(10,2))]

fork suggestors ...
***PATTI: goto home: (10,5)
user wants direction from (10,5) to (10,5)
user wants path from (10,5) to (10,5)
shortest path from (10,5) to (10,5)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,5) to (10,5)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

possible commands: [(0,1 Move S),(0,1 Move W),(0,1 Pick),(0,1 Drop)]
... suggestors forked
first item: Just (0,1 Move S)
next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move S
number = 165
CPU time already used: 38560000000000 
 rounded to 38560 milliseconds 
 average:  233 milliseconds per move.
<< #241 S #666 N
new info: id = 241, capacity = 10, money = 336, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(10,3))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 336, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,4)),(666,(10,3))]

fork suggestors ...
... suggestors *pf*oo*srPskAieTbdTl
Ie:  cgoomtmoa nhdosm:e :[ ((01,01, 4M)o
ve uNs)e,r( 0w,a1n tMso vdei rSe)c,t(i0o,n1  fMroovme  (W1)0,,(40), 1t oP i(c1k0),,4()0
,1 uDsreorp )w]a
ntsf iprastth  iftreomm:  (J1u0s,t4 )( 0t,o1  (M1o0v,e4 )W
)
shortest path from (10,4) to (10,4)
~2~3~4~4~4~4~4~4~4~4~3~1~0flooding done
shortest path from (10,4) to (10,4)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 166
CPU time already used: 38580000000000 
 rounded to 38580 milliseconds 
 average:  232 milliseconds per move.
<< #241  N #666  N
new info: id = 241, capacity = 10, money = 335, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(10,4))]

<< 
new info (pack_update): id = 241, capacity = 10, money = 335, score = 6
packs = [(241,[]),(666,[])]
poss = [(241,(10,5)),(666,(10,4))]

fork suggestors ...
... suggestor*ps*o *sfPsoAirTbkTleIed: 
 cgoomtmoa nhdosm:e :[ ((01,01, 5M)o
ve uSs)e,r( 0w,a1n tMso vdei rWe)c,t(i0o,n1  fPriocmk )(,1(00,,51)  Dtroo p()1]0
,5)f
irsuts eirt ewma:n tJsu spta t(h0 ,f1r oMmo v(e1 0W,)5
) to (10,5)
shortest path from (10,5) to (10,5)
~2~2~3~4~4~4~4~4~4~4~3~2~1~0flooding done
shortest path from (10,5) to (10,5)
is  InvalidWay

Fail: No match in record selector Geo.Type.pos

next item: Nothing
ok, time is over
killing all suggestors ...
... killed all suggestors
picking best suggestion
>> 1 Move W
number = 167
CPU time already used: 38590000000000 
 rounded to 38590 milliseconds 
 average:  231 milliseconds per move.
<< Robot 241 died.

Fail: incorrect update-string

real	2m53.117s
user	0m37.120s
sys	0m1.520s
