Author/Authors
DOĞAN, Muzaffer Anadolu Üniversitesi - Mühendislik Fakültesi - Bilgisayar Mühendisliği, İki Eylül Kampüsü, Turkey
Title Of Article
A PARALLEL DEPTH-FIRST SEARCH ALGORITHM USING LIST OF QUEUES ON PEG SOLITAIRE GAME
شماره ركورد
34126
Abstract
For the Peg Solitaire game, existing computers can easily compute the moves required to obtain the solution board with one peg in a short time by applying the DFS algorithm. In order to shorten the solution time, advantages of parallel processing has been used in this paper. The problems that occur during locking and unlocking while accessing shared resources and processing sibling nodes before child nodes are solved by introducing List of Queues data structure and shorter execution times has been obtained compared to non-parallel DFS solution. English version of the Peg Solitaire game has been used in the experiments.
From Page
69
NaturalLanguageKeyword
List of Queues , Parallel Depth , First Search , Game Programming , Peg Solitaire.
JournalTitle
Anadolu University Journal of Science and Technology. A : Applied Sciences and Engineering
To Page
80
JournalTitle
Anadolu University Journal of Science and Technology. A : Applied Sciences and Engineering
Link To Document