191 reputation
7
bio website
location
age
visits member for 1 year, 11 months
seen Nov 1 at 4:28

Sep
24
awarded  Autobiographer
Jun
13
comment Mathematical research of Pokémon
I modeled a very limited scenario (Charmander vs Gen 1 Misty with no PP limitations) and solved it exactly as a Markov Decision Process (since the Gen 1 AI uses a known, simple distribution of actions). However, even this limited case was very complicated. Simply simulating general Gen 1 battles is enormously complex and the difficulty grows exponentially with every new generation as new interactions between abilties are introduced.
May
14
awarded  Informed
Jan
14
awarded  Scholar
Jan
14
accepted Minimum size of spanning tree or seperator
Jan
14
revised Minimum size of spanning tree or seperator
added 183 characters in body
Jan
1
answered Another difficultl limit I need help with
Dec
28
awarded  Teacher
Dec
28
answered A number of dice rolls to see every number at least once
Dec
28
answered Minimum size of spanning tree or seperator
Dec
27
comment For a graph $G$, why should one expect the ratio $\text{ex} (n;G)/ \binom n2$ to converge?
This doesn't answer the question at all.
Dec
27
awarded  Editor
Dec
27
awarded  Supporter
Dec
25
awarded  Student
Dec
25
asked Minimum size of spanning tree or seperator