2021, Vol. 2, Issue 2, Part A
Modeling snakes and ladders as an abstract machine
Author(s): Roshan Ahmed
Abstract: On comparison from a certain angle, the popular classical board game, Snakes and Ladders, is similar in format to string computational devices, leading to an interesting relationship between them. Thus, this paper will be detailing on how to model an abstract device that uses the computation pattern similar to snake and ladders, with N states and a random number from 1 to n jumps for each character, including the "snake" and the "ladder" which will put the current state to a different state in forward or in the backward directions. We will mainly, analyze the time to "finish the game" also known as the total computation cycles by running simulations of it with different values for n and N, with randomized and special mathematical pattern generated snakes and ladders. The benefits of developing such an abstract device would be beneficial on the fronts of privatized, yet mass applicable many-to-one checksum method. This checksum method will work by determining if the letters of a public encrypted string, if converted to dice rolls, will be able to “win†in a private game board of snake and ladders, thus additionally, a method to generate such abstract game boards to create discreet checksums for different purposes, such that if a string is accepted on one board, it should not be able to win on another.
Pages: 55-59 | Views: 1168 | Downloads: 755
Download Full Article: Click Here
How to cite this article:
Roshan Ahmed. Modeling snakes and ladders as an abstract machine. Int J Res Circuits Devices Syst 2021;2(2):55-59.
