Test with starting point at Exeter using default (linear) matching algorithm and cache size 30

Cache is built using a square with sides 20 km. User's path has steps of (2000, 2000) metres, with a total of 11 retrievals. Amount of look-ahead (both E and N) is 0km. Cache size is 30. (Size is set as a fixed value, derived from original size of 117).

Point furthest from the centre of cache (29200000, 09200000) is 3048220, 0826790; distance away is: 15.8808 kilometres.

Results for Exeter (OS 292,092) using default (linear) algorithm and 0 look-ahead
Threshold Total benchmark retrievals Retrievals lost
99% 27 1
98% 45 4
96% 142 43
93% 450 238

Default matching algorithm used was: (version pjb Jan 6b 2003) .

Commentary on this starting point: this may be a favourable case as the cache is centred on an area with lots of attractions, and the area outside the cache has fewer attractions.