| 摘要 |
The invention describes the computational automation of baseball, which is supported on a finite state automaton and a formal language for describing any correct play. Using this automaton and this language ensure the mathematically correct modelling and implementation of the algorithms for computer simulation of a baseball game. For algorithmic automation of baseball according to the invention, a formal grammar is defined that translates the rules of the baseball game; by using said grammar, a formal language is generated to describe any possible play during a baseball game. This formal language is read by the corresponding state automaton. Also, a generator of baseball plays creates the plays based on average probability occurrence of each of these plays in games played by humans in professional tournaments. Therefore, plays such as "STRIKES", "FOULS", "HITS", "HOMERUN", including the number of runs, etc., occur according the rules of the game and with the average frequency with which would occur in real life matches. |
