Generalized Game Trees and their Evaluation

dc.contributor.authorBasbous, Raed
dc.contributor.authorNagy, Benedek
dc.date.accessioned2026-02-06T18:17:31Z
dc.date.issued2014
dc.departmentDoğu Akdeniz Üniversitesi
dc.description5th IEEE International Conference on Cognitive Infocommunications (CogInfoCom) -- NOV 05-07, 2014 -- Vietri sul Mare, ITALY
dc.description.abstractExpression trees are well-known tools to visualize the syntactical structure of the expressions. They are helpful also in evaluation. Games and game theory form an important field in Artificial Intelligence and it has several connections to Business and Economy. Game trees are used to represent games. In this paper, some types of extensions of game trees are considered using operations, e.g., multiplication, (constrained) addition and the usual minimum and maximum. Evaluation techniques are presented, as well as, various pruning algorithms that can quicken the evaluation in several cases.
dc.description.sponsorshipIEEE
dc.identifier.endpage60
dc.identifier.isbn978-1-4799-7280-7
dc.identifier.scopus2-s2.0-84946690688
dc.identifier.scopusqualityN/A
dc.identifier.startpage55
dc.identifier.urihttps://hdl.handle.net/11129/9029
dc.identifier.wosWOS:000389273200009
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherIEEE
dc.relation.ispartof2014 5Th Ieee Conference on Cognitive Infocommunications (Coginfocom)
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectexpression trees
dc.subjectgame trees
dc.subjectminimax algorithm
dc.subjectshortcut evaluation
dc.subjectalpha-beta pruning
dc.subjectdecision making
dc.subjectcuts of trees
dc.titleGeneralized Game Trees and their Evaluation
dc.typeConference Object

Files