Communication Interruption Between a Game Tree and Its Leaves

  • Toshio SuzukiEmail author
Conference paper


We introduce a successor model of an AND-OR tree. Leaves are connected to internal nodes via communication channels that possibly have high probability of interruption. By depth-first communication we mean the following protocol: if a given algorithm probes a leaf then it continues to make queries to that leaf until return of an answer. For each such tree, we give a concrete example of interruption probability setting with the following property. For any independent and identical distribution on the truth assignments (probability is assumed to be neither 0 nor 1), any depth-first search algorithm that performs depth-first communication is not optimal. This result makes sharp contrast with the counterpart on the usual AND-OR tree (Tarsi) that optimal and depth-first algorithm exists. Our concrete example is based on Riemann zeta function. We also present a generalized framework.


AND-OR tree Depth-first algorithm Directional algorithm Optimal algorithm Communication channel Communication interruption Riemann zeta function Independent and identical distribution 



We are grateful to the anonymous referees of the previous version for helpful advices. We wish to thank the attendants of IMECS 2018 for valuable discussion.


  1. 1.
    Abramowitz, M., Stegun, I.A. (eds.): Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables, Tenth Printing. U.S. Government Printing Office, Washington, D.C. (1972)Google Scholar
  2. 2.
    Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6, 293–326 (1975)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Liu, C.G., Tanaka, K.: Eigen-distribution on random assignments for game trees. Inform. Process. Lett. 104, 73–77 (2007)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Pearl, J.: Asymptotic properties of minimax trees and game-searching procedures. Artif. Intell. 14, 113–138 (1980)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Pearl, J.: The solution for the branching factor of the alpha-beta pruning algorithm and its optimality. Commun. ACM 25, 559–564 (1982)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Peng, W., Peng, N.N., Ng, K.M., Tanaka, K., Yang, Y.: Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees. Inform. Process. Lett. 125, 41–45 (2017)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Peng, W., Okisaka, S., Li, W., Tanaka, K.: The uniqueness of eigen-distribution under non-directional algorithms. IAENG Int. J. Comput. Sci. 43, 318–325 (2016)Google Scholar
  8. 8.
    Saks, M., Wigderson, A.: Probabilistic Boolean decision trees and the complexity of evaluating game trees. In: Proceedings of 27th IEEE FOCS, pp. 29–38 (1986)Google Scholar
  9. 9.
    Suzuki, T.: Kazuyuki Tanaka’s work on AND-OR trees and subsequent developments. Ann. Jpn. Assoc. Philos. Sci. 25, 79–88 (2017)MathSciNetGoogle Scholar
  10. 10.
    Suzuki, T.: An AND-OR-tree connected to leaves via communication channels. In: Lecture Notes in Engineering and Computer Science: Proceedings of The International MultiConference of Engineers and Computer Scientists, Hong Kong, 14–16 March 2018, pp. 185–189 (2018)Google Scholar
  11. 11.
    Suzuki, T.: Non-depth-first search against an independent distribution on a balanced AND-OR tree. Inform. Process. Lett. 139, 13–17 (2018)Google Scholar
  12. 12.
    Suzuki, T., Nakamura, R.: The eigen distribution of an AND-OR tree under directional algorithms. IAENG Int. J. Appl. Math. 42, 122–128 (2012)MathSciNetGoogle Scholar
  13. 13.
    Suzuki, T., Niida, Y.: Equilibrium points of an AND-OR tree: under constraints on probability. Ann. Pure Appl. Logic 166, 1150–1164 (2015)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Tarsi, M.: Optimal search on some game trees. J. ACM 30, 389–396 (1983)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Department of Mathematical SciencesTokyo Metropolitan UniversityHachiojiJapan

Personalised recommendations