[edit] What is below is actually not for rainbow tables, but for a complete lookup table. Now that I did a little more reading
: rainbow tables are really cool, but not really applicable to this problem.
While it would produce more accurate results for those battles that are in the table, constructing a table with all battles would be prohibitively expensive. The number of entries in the table (assuming an upper diagonal form) goes as n*(n+1)/2, where n is the number of different fleet configurations. With 100 fleet points and ~20 ships, the number of fleet configurations is gigantic... certainly greater than 185,000 (~ 20 choose 10, ballpark estimate) which would make the table have 17 billion entries. At 5 seconds per full battle simulation this would take ~162,000 years to make
. Thats not even all of them, with absolutely nothing about weapons, officers, damage levels... (Welcome to combinatorics!)
Ok, ok, we wouldn't actually make the whole table - we'd just try to make a few representative samples. But then we'd need some way to get from a table entry to the real battle - say one side has an extra frigate compared to the entry so give them a bonus and they are using more kinetic so... but thats not really any better than the system we have now.
I do think the current autoresolve needs a few tweaks, but on the whole its sound.