The Depth First Search Algorithm (DFS) is one form of the Search Algorithm, DFS performs a search by expanding the first root child of the selected search tree and going deeper until the destination node is found, or until it finds a node that has no children. Then Search Backtracking will return to the node that has not finished tracing. Fisher Yates Algorithm is one of several Randomization Algorithms. Fisher Yates was used to change the order of a randomly given input. The permutations generated by this algorithm appear with the same probability. In this educational game, this Counting Operation was formed based on these two algorithms. The DFS algorithm is used in the maze-making process and in the randomization process with the Fisher Yates Algorithm. The form of this Counting Operations educational game, players explore the labyrinth space while passing through the numbers that appear. The numbers that have been skipped will be stored by the system to perform a Count Operation according to the player’s initial choice. When the player manages to find a way out of the Labyrinth, a question will appear, how many answers are there from the numbers that have been passed after the calculation operation is carried out. If the player succeeds in answering the question, a score will be given in the form of a star.
Skip Nav Destination
Article navigation
25 July 2023
INTERNATIONAL CONFERENCE OF SNIKOM 2021
18 September 2021
Medan, Indonesia
Research Article|
July 25 2023
Depth first search and Fisher yates algorithm in arithmetic operations of educational game
Doni El Rezen Purba;
Doni El Rezen Purba
a)
Universitas Katolik Santo Thomas
, Medan, Indonesia
a)Corresponding author: [email protected]
Search for other works by this author on:
Anirma Kandida Ginting;
Anirma Kandida Ginting
Universitas Katolik Santo Thomas
, Medan, Indonesia
Search for other works by this author on:
Alex Rikki;
Alex Rikki
Universitas Katolik Santo Thomas
, Medan, Indonesia
Search for other works by this author on:
Zekson Arizona Matondang
Zekson Arizona Matondang
Universitas Katolik Santo Thomas
, Medan, Indonesia
Search for other works by this author on:
a)Corresponding author: [email protected]
AIP Conf. Proc. 2798, 020018 (2023)
Citation
Doni El Rezen Purba, Anirma Kandida Ginting, Alex Rikki, Zekson Arizona Matondang; Depth first search and Fisher yates algorithm in arithmetic operations of educational game. AIP Conf. Proc. 25 July 2023; 2798 (1): 020018. https://doi.org/10.1063/5.0154365
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
27
Views
Citing articles via
Inkjet- and flextrail-printing of silicon polymer-based inks for local passivating contacts
Zohreh Kiaee, Andreas Lösel, et al.
Effect of coupling agent type on the self-cleaning and anti-reflective behaviour of advance nanocoating for PV panels application
Taha Tareq Mohammed, Hadia Kadhim Judran, et al.
Design of a 100 MW solar power plant on wetland in Bangladesh
Apu Kowsar, Sumon Chandra Debnath, et al.
Related Content
Analysis of student satisfaction levels with administrative services in the Covid-19 pandemic period using servqual method
AIP Conf. Proc. (July 2023)
Antenna coupled Kinetic Inductance arrays for space and ground based imaging arrays
AIP Conference Proceedings (December 2009)
Comment on “Regularized SCAN functional” [J. Chem. Phys. 150, 161101 (2019)]
J. Chem. Phys. (November 2019)
Algorithm for J-integral measurement by digital image correlation method
AIP Conf. Proc. (December 2018)
Surface Science: An Introduction
Physics Today (October 2004)