Path Search in the Pyramid and in Other Graphs
We are given an acyclic directed graph with one source, and a subset of its edges that contains exactly one outgoing edge for every nonsink vertex. These edges determine a unique path from the source to a sink. We can think of it as a switch in every vertex, which determines which way the water arriving to that vertex flows further. We are interested in determining either the sink as the flow arrives, or the whole path, with as few questions as possible. The questions we can ask correspond to the vertices of the graph, and the answer describes the switch, that is, tells which outgoing edge is in our given subset. Originally the problem was proposed by Soren Riis (who posed the question for pyramid graphs) in the following more general form: We are given a natural number k, and k questions can be asked in a round. The goal is to minimize the number of rounds. We completely solve this problem for complete t-ary trees. Also, for pyramid graphs we present some nontrivial partial results.
AMS Subject Classification90B40
KeywordsSearch Parallel search Path Pyramid graph Grid graph
Unable to display preview. Download preview PDF.
- Brügmann, B. 1993. Monte Carlo go. Technical report, Physics Department, Syracuse University, Syracuse, NY.Google Scholar
- Fishman, G. S. 1996. Monte Carlo. Concepts, algorithms, and applications. Springer Series in Operations Research. New York, NY, Springer-Verlag.Google Scholar
- Kocsis, L., and C. Szepesvári. 2006. Bandit based Monte-Carlo planning. 15th European Conference on Machine Learning (ECML 2006), pp. 282–293.Google Scholar