/agdg/ here.
I have a math problem.
I want to make king of fighters inside fighter maker.
The issue is that the engine only allows 1 vs 1 fights.
However people have found work arounds but they require to code all the characters from the tag team inside a single character.
As such I'm aware of two systems right now, which is the Vanguard princess and the SCWU games.
Basically VP uses a system of a puppet character you can select, and SCWU let you pick the character color during select screen.
So here's the idea.
I can use a single character inside every file, which can be the main selection like VP, use a number of secondary puppets and a third selection using the button selection.
Basically three selections or three groups.
The first group should have a single repetition, the second selection could have an indeterminate number of selections and the third selection is of six posibilities.
Basically the goal is to emulate the combinations of the original game with these limitations.
It's basically the following equation:
goal = combination of 70 characters, arranged in groups of 3.
g1 = X number of 1 character selection (can't be cloned)
g2 = X number of Y size of secondary characters (can be repeated)
g3 = group of 6 characters (can not be repeated with g1 or g3)
Let's call TEAM the file produced with the combination of g1 + g2 + g3
So, the question is the following.
Find the minimal amount of TEAM required to produce GOAL.
I have a math problem.
I want to make king of fighters inside fighter maker.
The issue is that the engine only allows 1 vs 1 fights.
However people have found work arounds but they require to code all the characters from the tag team inside a single character.
As such I'm aware of two systems right now, which is the Vanguard princess and the SCWU games.
Basically VP uses a system of a puppet character you can select, and SCWU let you pick the character color during select screen.
So here's the idea.
I can use a single character inside every file, which can be the main selection like VP, use a number of secondary puppets and a third selection using the button selection.
Basically three selections or three groups.
The first group should have a single repetition, the second selection could have an indeterminate number of selections and the third selection is of six posibilities.
Basically the goal is to emulate the combinations of the original game with these limitations.
It's basically the following equation:
goal = combination of 70 characters, arranged in groups of 3.
g1 = X number of 1 character selection (can't be cloned)
g2 = X number of Y size of secondary characters (can be repeated)
g3 = group of 6 characters (can not be repeated with g1 or g3)
Let's call TEAM the file produced with the combination of g1 + g2 + g3
So, the question is the following.
Find the minimal amount of TEAM required to produce GOAL.
