Is there any mathematical formula to calculate the minimum value from the below presumption?












0












$begingroup$


I am trying to balance a board game, where monsters activated based on a given rule, and I am looking for a formula, which takes in account the attacks of the heroes (2-4 heroes [noh], each with a single attack that has a unique attack value [av], and penetration [ap]), and the number of the monsters (1-9 different monsters, each with different health [mh], armor [ma], current enrage value [mce], and max enrage value [mme]), and wants to find the minimum number of activations [na].



The rule set looks something like this: in turn, each hero makes an attack against a single monster (any one monster). For each attack a hero makes, the monsters health is reduced in the following way:



mh = max(0, mh - max(0, (av - max(0, ma-ap))))



After the attack, the monsters current enrage value gets subtracted by 1: mce = mce -1. If mce <= 0, we perform: na = na + 1; mce = mce + mme;.



After each hero performed one move, each monsters mce value changes the following way: mce = mce - (noh - 1). If any monsters mce <= 0, we perform the following operations on the monsters: na = na + 1; mce = mce + mme;



Given these rules, I am looking for a mathematics formula that could calculate the min value of na for a given combat.



Would this calculation be even possible with a simple formula, or simulation is the only way to get the result I am looking for?



EDIT: ma < (ap + av) this presumption is always true, for each monster and each hero attack.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Even though it seems plausible to first kill the monster with lowest mme, this is apparently not the best strategy (e.g., some of the heroes with $text{av}+text{ap}le text{ma}$ might even be worthless against that monster). As a first approximation, I'd suggest that all heroes capable of hurting the monster with currently lowest mme do so while the other heroes attack monsters with weak enough armour (thus making as many hit points as possible)
    $endgroup$
    – Hagen von Eitzen
    Jan 5 at 14:25










  • $begingroup$
    @HagenvonEitzen it is impossible for a monster to have ma >= av + ap, I forgot to mention this, in the original post, sorry
    $endgroup$
    – Adam Baranyai
    Jan 5 at 14:30
















0












$begingroup$


I am trying to balance a board game, where monsters activated based on a given rule, and I am looking for a formula, which takes in account the attacks of the heroes (2-4 heroes [noh], each with a single attack that has a unique attack value [av], and penetration [ap]), and the number of the monsters (1-9 different monsters, each with different health [mh], armor [ma], current enrage value [mce], and max enrage value [mme]), and wants to find the minimum number of activations [na].



The rule set looks something like this: in turn, each hero makes an attack against a single monster (any one monster). For each attack a hero makes, the monsters health is reduced in the following way:



mh = max(0, mh - max(0, (av - max(0, ma-ap))))



After the attack, the monsters current enrage value gets subtracted by 1: mce = mce -1. If mce <= 0, we perform: na = na + 1; mce = mce + mme;.



After each hero performed one move, each monsters mce value changes the following way: mce = mce - (noh - 1). If any monsters mce <= 0, we perform the following operations on the monsters: na = na + 1; mce = mce + mme;



Given these rules, I am looking for a mathematics formula that could calculate the min value of na for a given combat.



Would this calculation be even possible with a simple formula, or simulation is the only way to get the result I am looking for?



EDIT: ma < (ap + av) this presumption is always true, for each monster and each hero attack.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Even though it seems plausible to first kill the monster with lowest mme, this is apparently not the best strategy (e.g., some of the heroes with $text{av}+text{ap}le text{ma}$ might even be worthless against that monster). As a first approximation, I'd suggest that all heroes capable of hurting the monster with currently lowest mme do so while the other heroes attack monsters with weak enough armour (thus making as many hit points as possible)
    $endgroup$
    – Hagen von Eitzen
    Jan 5 at 14:25










  • $begingroup$
    @HagenvonEitzen it is impossible for a monster to have ma >= av + ap, I forgot to mention this, in the original post, sorry
    $endgroup$
    – Adam Baranyai
    Jan 5 at 14:30














0












0








0





$begingroup$


I am trying to balance a board game, where monsters activated based on a given rule, and I am looking for a formula, which takes in account the attacks of the heroes (2-4 heroes [noh], each with a single attack that has a unique attack value [av], and penetration [ap]), and the number of the monsters (1-9 different monsters, each with different health [mh], armor [ma], current enrage value [mce], and max enrage value [mme]), and wants to find the minimum number of activations [na].



The rule set looks something like this: in turn, each hero makes an attack against a single monster (any one monster). For each attack a hero makes, the monsters health is reduced in the following way:



mh = max(0, mh - max(0, (av - max(0, ma-ap))))



After the attack, the monsters current enrage value gets subtracted by 1: mce = mce -1. If mce <= 0, we perform: na = na + 1; mce = mce + mme;.



After each hero performed one move, each monsters mce value changes the following way: mce = mce - (noh - 1). If any monsters mce <= 0, we perform the following operations on the monsters: na = na + 1; mce = mce + mme;



Given these rules, I am looking for a mathematics formula that could calculate the min value of na for a given combat.



Would this calculation be even possible with a simple formula, or simulation is the only way to get the result I am looking for?



EDIT: ma < (ap + av) this presumption is always true, for each monster and each hero attack.










share|cite|improve this question











$endgroup$




I am trying to balance a board game, where monsters activated based on a given rule, and I am looking for a formula, which takes in account the attacks of the heroes (2-4 heroes [noh], each with a single attack that has a unique attack value [av], and penetration [ap]), and the number of the monsters (1-9 different monsters, each with different health [mh], armor [ma], current enrage value [mce], and max enrage value [mme]), and wants to find the minimum number of activations [na].



The rule set looks something like this: in turn, each hero makes an attack against a single monster (any one monster). For each attack a hero makes, the monsters health is reduced in the following way:



mh = max(0, mh - max(0, (av - max(0, ma-ap))))



After the attack, the monsters current enrage value gets subtracted by 1: mce = mce -1. If mce <= 0, we perform: na = na + 1; mce = mce + mme;.



After each hero performed one move, each monsters mce value changes the following way: mce = mce - (noh - 1). If any monsters mce <= 0, we perform the following operations on the monsters: na = na + 1; mce = mce + mme;



Given these rules, I am looking for a mathematics formula that could calculate the min value of na for a given combat.



Would this calculation be even possible with a simple formula, or simulation is the only way to get the result I am looking for?



EDIT: ma < (ap + av) this presumption is always true, for each monster and each hero attack.







simulation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 5 at 14:31







Adam Baranyai

















asked Jan 5 at 13:50









Adam BaranyaiAdam Baranyai

936




936








  • 1




    $begingroup$
    Even though it seems plausible to first kill the monster with lowest mme, this is apparently not the best strategy (e.g., some of the heroes with $text{av}+text{ap}le text{ma}$ might even be worthless against that monster). As a first approximation, I'd suggest that all heroes capable of hurting the monster with currently lowest mme do so while the other heroes attack monsters with weak enough armour (thus making as many hit points as possible)
    $endgroup$
    – Hagen von Eitzen
    Jan 5 at 14:25










  • $begingroup$
    @HagenvonEitzen it is impossible for a monster to have ma >= av + ap, I forgot to mention this, in the original post, sorry
    $endgroup$
    – Adam Baranyai
    Jan 5 at 14:30














  • 1




    $begingroup$
    Even though it seems plausible to first kill the monster with lowest mme, this is apparently not the best strategy (e.g., some of the heroes with $text{av}+text{ap}le text{ma}$ might even be worthless against that monster). As a first approximation, I'd suggest that all heroes capable of hurting the monster with currently lowest mme do so while the other heroes attack monsters with weak enough armour (thus making as many hit points as possible)
    $endgroup$
    – Hagen von Eitzen
    Jan 5 at 14:25










  • $begingroup$
    @HagenvonEitzen it is impossible for a monster to have ma >= av + ap, I forgot to mention this, in the original post, sorry
    $endgroup$
    – Adam Baranyai
    Jan 5 at 14:30








1




1




$begingroup$
Even though it seems plausible to first kill the monster with lowest mme, this is apparently not the best strategy (e.g., some of the heroes with $text{av}+text{ap}le text{ma}$ might even be worthless against that monster). As a first approximation, I'd suggest that all heroes capable of hurting the monster with currently lowest mme do so while the other heroes attack monsters with weak enough armour (thus making as many hit points as possible)
$endgroup$
– Hagen von Eitzen
Jan 5 at 14:25




$begingroup$
Even though it seems plausible to first kill the monster with lowest mme, this is apparently not the best strategy (e.g., some of the heroes with $text{av}+text{ap}le text{ma}$ might even be worthless against that monster). As a first approximation, I'd suggest that all heroes capable of hurting the monster with currently lowest mme do so while the other heroes attack monsters with weak enough armour (thus making as many hit points as possible)
$endgroup$
– Hagen von Eitzen
Jan 5 at 14:25












$begingroup$
@HagenvonEitzen it is impossible for a monster to have ma >= av + ap, I forgot to mention this, in the original post, sorry
$endgroup$
– Adam Baranyai
Jan 5 at 14:30




$begingroup$
@HagenvonEitzen it is impossible for a monster to have ma >= av + ap, I forgot to mention this, in the original post, sorry
$endgroup$
– Adam Baranyai
Jan 5 at 14:30










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3062739%2fis-there-any-mathematical-formula-to-calculate-the-minimum-value-from-the-below%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3062739%2fis-there-any-mathematical-formula-to-calculate-the-minimum-value-from-the-below%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei