I think I just realized the relationships between toons in Looney Toons: World of Mayhem is basically a graph... And so the optimal teams can be found by solving Pick 4 Vertices (toons) that maximize the # of Edges (positive relationships) between them...

Is there an algorithm that finds that or I just bring force it by testing all combos? Given the # of toons shouldn't take too long.

  • 0
    So it sorta works in theory, but because of other factors like skill levels, it doesn't quite work in reality...

    Guess need to weight the different attributes as well.
  • 1
    Well... It definitely sounds np-complete. But formalize the problem first.
Your Job Suck?
Get a Better Job
Add Comment