Abstract
We propose a model for level-ups in Heroes of Might and Magic III, and give an \(\mathcal{O}(\frac{1}{\varepsilon^{2}} ln (\frac{1}{\delta}))\) learning algorithm to estimate the probabilities of secondary skills induced by any policy in the end of the leveling-up process. We develop software and test our model in an experiment. The correlation coefficient between theory and practice is greater than 0.99. The experiment also indicates that the process responsible for the randomization that takes place on level-ups generates only a few different pseudo-random sequences. This might allow exploitation techniques in the near future; hence that process might require reengineering.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dawkins, B.: Siobhan’s Problem: The Coupon Collector Revisited. The American Statistician 45(1), 76–82 (1991)
Efron, B., Thisted, R.: Estimating the Number of Unseen Species: How Many Words Did Shakespeare Know? Biometrika 63(3), 435–447 (1976)
Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association 58(301), 13–30 (1963)
Mascagni, M.: SPRNG: A Scalable Library for Pseudorandom Number Generation. In: Parallel Processing for Scientific Computing (1999)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diochnos, D.I. (2010). Leveling-Up in Heroes of Might and Magic III. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)