Test with starting point at Exeter using research library (N-squared) matching algorithm and cache size 48

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 10km. Cache size is 48. (Size is set as a fixed value, derived from original size of 74).

Point furthest from the centre of cache (30200000, 10200000) is 3249000, 1005000; distance away is: 22.9491 kilometres.

Results for Exeter (OS 292,092) using research library (N-squared) algorithm and 10 look-ahead
Threshold Total benchmark retrievals Retrievals lost
50% 1 0
20% 10 0
10% 37 0
5% 453 60

Non-default algorithm used was: Context Matcher with N-squared location-matching algorithm: version of Jan 4 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.