The Eigen-distribution for multi-branching trees

Weiguang Peng, Shohei Okisaka, Wenjuan Li, Kazuyuki Tanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In the present work, we extend the studies on eigen-distribution for uniform binary trees to balanced multi- branching trees. We show that for such general trees, an eigen- distribution is still equivalent to E%-distribution with respect to alpha-beta pruning algorithms and the uniqueness of eigen- distribution holds, although the uniqueness fails if we are restricted to directional algorithms.

Original languageEnglish
Title of host publicationIMECS 2016 - International Multiconference of Engineers and Computer Scientists 2016
EditorsCraig Douglas, David Dagan Feng, S. I. Ao, Oscar Castillo, Alexander M. Korsunsky
PublisherNewswood Limited
Pages88-93
Number of pages6
ISBN (Electronic)9789881925381
Publication statusPublished - 2016
EventInternational Multiconference of Engineers and Computer Scientists 2016, IMECS 2016 - Tsimshatsui, Kowloon, Hong Kong
Duration: 2016 Mar 162016 Mar 18

Publication series

NameLecture Notes in Engineering and Computer Science
Volume1
ISSN (Print)2078-0958

Other

OtherInternational Multiconference of Engineers and Computer Scientists 2016, IMECS 2016
Country/TerritoryHong Kong
CityTsimshatsui, Kowloon
Period16/3/1616/3/18

Keywords

  • AND-OR trees
  • Alpha-beta pruning algorithms
  • Balanced trees
  • Randomized complexity
  • Uniform trees

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Fingerprint

Dive into the research topics of 'The Eigen-distribution for multi-branching trees'. Together they form a unique fingerprint.

Cite this