arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.00864cs.CR
收藏

Logistic Map在游戏开发伪随机数生成中的分析

Analysis of Logistic Map for Pseudorandom Number Generation in Game Development

Chenxiao Zhou

AI总结:

针对现有伪随机生成器种子输入选择有限的问题,本文分析Logistic Map混沌映射并提出伪随机序列与游戏对象随机位置生成算法,在贪吃蛇实验中验证其可行性与可复现随机性。

摘要:

许多流行的电子游戏使用伪随机数生成器来创建游戏对象的随机分布位置,使其尽可能不可预测。一些场景(如游戏竞赛)还需要可复现的随机性,即在给定相同种子输入时,随机结果可以复现。现有的随机生成方法在种子输入方面选择有限。为解决这一局限,本研究分析了一种名为Logistic Map的混沌映射在游戏开发中的应用。在分析了该混沌映射的特性之后,我开发了一种伪随机序列生成算法以及一种游戏对象随机位置的生成算法。在贪吃蛇游戏上的实验表明,Logistic Map可用于游戏开发。所提出的算法也实现了可复现的随机性。

英文摘要:

Many popular video games use pseudorandom number generators to create randomly distributed locations for game objects as highly unpredictable as possible. Some scenarios like game competition also need reproducible randomness, namely the random results can be reproducible if given the same seed input. Existing random generation methods have limited choices for seed input. To address this limitation, this study analyzes a chaotic map called the Logistic Map for game development. After analyzing the properties of this chaotic map, I developed a pseudorandom sequence generation algorithm and a generation algorithm of random locations of game objects. Experiments on the game of Snake demonstrate that the Logistic Map is viable for game development. The reproducible randomness is also realized with the proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑