Eigen-distribution on random assignments for game trees

@article{Liu2007EigendistributionOR,
  title={Eigen-distribution on random assignments for game trees},
  author={Chen-Guang Liu and Kazuyuki Tanaka},
  journal={Inf. Process. Lett.},
  year={2007},
  volume={104},
  pages={73-77}
}
In this Letter, we investigate a special distribution, called eigen-distribution, on random assignments for a class of game trees T k 2 . There are two cases, where the assignments to leaves are independently distributed (ID) and correlated distributed (CD). In the ID case, we prove that the distributional probability belongs to [ √ 7−1 3 , √ 5−1 2 ], and is a strictly increasing function on rounds k ∈ [1,∞). In the CD case, we propose a reverse assigning technique (RAT) to form two particular… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
5 Citations
15 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 15 references

The variance of two game tree algorithms

  • Y. Zhang
  • Journal of Algorithms
  • 1998
2 Excerpts

A minimax algorithm better than SSS∗

  • A. de Bruin, A. Plaat, J. Schaeffer, W. Pijls
  • Artificial Intelligence
  • 1996
1 Excerpt

A comparison of minimax tree search algorithms

  • T. A. Marsland
  • Artificial Intelligence
  • 1983

A comparison of minimax tree search algorithms, Artificial Intelligence

  • S. C. Murray, T. A. Marsland
  • 1983
1 Excerpt

Similar Papers

Loading similar papers…