Maybe I can help explain what I think he means.
Suppose you need 2d6 sneak attack.
You could try to solve it by a brute force method.
Barbarian 1? no
Bard 1? no
Cleric 1? no
...
Barbarian 1, bard 1, cleric 1, druid 1, fighter 1, ranger 1, rogue 1, sorceror 1, wizard 1? no
etc.
This way will not work. The numbers become unmanagable.
So he proposes an indexed method. Instead of looking at each possible combination, you simply have a list of all possible ways to get sneak attack. So you might have a list like:
[Sneak Attack 1d6]
rogue 1
assassin 1 (requires ... )
invisible blade 1 (requires ... )
slayer of domiel 1 (requires ... )
spellthief 1
swordsage 5 (gives 2d6 SA)
any 2 + swordsage 4 (gives 2d6 SA)
any 4 + swordsage 3 (gives 2d6 SA)
any 6 + swordsage 2 (gives 2d6 SA)
any 10 + feat(martial study) + feat(martial stance) (gives 2d6 SA)
[Sneak Attack 2d6]
any 2 of 1d6 sneak attack
rogue 3
assassin 3 (requires ... )
invisible blade 3 (requires ... )
slayer of domiel 3 (requires ... )
spellthief 5
swordsage 5
any 2 + swordsage 4
any 4 + swordsage 3
any 6 + swordsage 2
any 10 + feat(martial study) + feat(martial stance)
Note: the lists are not meant to be complete. I simply listed a few to help illustrate the point.
Hope that helps
Edit: you would have to have lots of indexed lists. Including, but not limited to:
sneak attack
1-1 BAB
good save (fort)
good save (reflex)
good save (will)
class skill(x)
class skill(y)
class skill(z)
weapon proficiency(all martial)
weapon proficiency(x)
alignment(good)
alignment(evil)
basically, you'd have to find all the PRC requirements listed, and make at least 1 list for each requirement.
edit 2: in truth, the answer probably lies with a combination of indexed lists and brute force.