Pages that link to "Item:Q1837547"
From MaRDI portal
The following pages link to Pathology on game trees revisited, and an alternative to minimaxing (Q1837547):
Displaying 18 items.
- Independent-valued minimax: Pathological or beneficial? (Q417993) (← links)
- When is it better not to look ahead? (Q622121) (← links)
- Bias and pathology in minimax search (Q817803) (← links)
- Game tree searching by min/max approximation (Q1096402) (← links)
- Asymptotic properties of level-regular decision trees with randomly evaluated leaves (Q1099794) (← links)
- Conspiracy numbers for min-max search (Q1102218) (← links)
- A Bayesian approach to relevance in game playing (Q1127355) (← links)
- Benefits of using multivalued functions for minimaxing (Q1128640) (← links)
- The multi-player version of minimax displays game-tree pathology (Q1313961) (← links)
- Unifying single-agent and two-player search (Q1602466) (← links)
- A study of decision error in selective game tree search (Q1602467) (← links)
- Limited lookahead in imperfect-information games (Q1989388) (← links)
- Is real-valued minimax pathological? (Q2457627) (← links)
- An incremental negamax algorithm (Q2639785) (← links)
- On game graph structure and its influence on pathology (Q3334108) (← links)
- From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future (Q3637316) (← links)
- Two-agent IDA* (Q4421276) (← links)
- Partial order bounding: A new approach to evaluation in game tree search (Q5941319) (← links)
