RecursivePatternMatching - Robo Wiki -= Collecting Robocode Knowledge =-

Okay this is my idea for a recursive PatternMatcher

find all matches for the first of x amount of turns to match
store matches in new array of matches.
re-call the method 2 which has index. and is a exact replica of first only it try's to match the data right after your index

Not really a new idea. MultipleChoice-SingleTickPatternMatching is basicaly what you describe. The only difference is you suggest is branching every x turns instead of every singe turn. I implemented MC-ST-PM last year and found that despite my reasonably optimized design it's far too slow and started skipping every turn before the first round even finished. Branching Every x ticks may improve the situation but I still believe it would be too slow to run unless x is so high that it's barely different than plain MC-PM. -- Rednaxela