A Comparative Study of Game Tree Searching Methods

dc.Affiliation	October University for modern sciences and Arts (MSA)
dc.contributor.author	El-Deeb, Hesham
dc.contributor.author	Gadallah, Mahmoud
dc.contributor.author	Aziem, Mostafa Abdel
dc.contributor.author	Elnaggar, Ahmed A
dc.date.accessioned	2019-12-25T08:22:43Z
dc.date.available	2019-12-25T08:22:43Z
dc.date.issued	2014-05
dc.description	Accession Number: WOS:000219161600010	en_US
dc.description.abstract	In this paper, a comprehensive survey on gaming tree searching methods that can use to find the best move in two players zero-sum computer games was introduced. The purpose of this paper is to discuss, compares and analyzes various sequential and parallel algorithms of gaming tree, including some enhancement for them. Furthermore, a number of open research areas and suggestions of future work in this field are mentioned.	en_US
dc.description.uri	https://www.scimagojr.com/journalsearch.php?q=21100867241&tip=sid&clean=0
dc.identifier.issn	2158-107X
dc.identifier.uri	https://t.ly/NjbPK
dc.language.iso	en_US	en_US
dc.publisher	SCIENCE & INFORMATION SAI ORGANIZATION LTD	en_US
dc.relation.ispartofseries	INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS;Volume: 5 Issue: 5 Pages: 68-77
dc.relation.uri	https://t.ly/e72DO
dc.subject	University for October University for GPU	en_US
dc.subject	distributed	en_US
dc.subject	parallel	en_US
dc.subject	evaluation	en_US
dc.subject	game tree search	en_US
dc.subject	searching	en_US
dc.title	A Comparative Study of Game Tree Searching Methods	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1