The following pages link to Searching with probabilities (Q3992828):
Displaying 13 items.
- Physical search problems with probabilistic knowledge (Q360037) (← links)
- Using Chunking to solve chess pawn endgames (Q792779) (← links)
- Game tree searching by min/max approximation (Q1096402) (← links)
- A Bayesian approach to relevance in game playing (Q1127355) (← links)
- A solution to the GHI problem for best-first search (Q1589511) (← links)
- Parallel randomized best-first minimax search. (Q1605282) (← links)
- Probably bounded suboptimal heuristic search (Q2321255) (← links)
- (Q3335552) (← links)
- Random sampling from a search engine's index (Q3452190) (← links)
- About the Completeness of Depth-First Proof-Number Search (Q3601830) (← links)
- Proof-Number Search and Its Variants (Q5302475) (← links)
- The effect of mobility on minimaxing of game trees with random leaf values (Q5958105) (← links)
- Improving heuristic mini-max search by supervised learning (Q5958202) (← links)