Home › In game AI, a FINITE STATE MACHINE can be limite…
In game AI, a FINITE STATE MACHINE can be limited by complexity blow-up. The Hierarchical FSM (HFSM) addresses this by which mechanism?
ASharing one state across multiple machines fully
BDisabling all transitions after first match
CRandom transitions between any pair of states
DStates that themselves contain inner state machines
Answer & Solution
Correct answer: D. States that themselves contain inner state machines
Buckland 'Programming Game AI by Example' Ch. 2 + Harel statecharts: HFSM nests states; outer 'patrol' may have inner 'walk', 'look', etc. Reuses substates.
Related questions
In Reynolds-style steering behaviours combined into a STEERING PIPELINE, the OUTPUT accelePer Dave Mark + Brian Schwab, a RESPONSE CURVE in utility AI maps an input variable to a sIn modern game AI, REINFORCEMENT LEARNING agents (e.g. OpenAI Five, DeepMind AlphaStar) lePer AlphaGo (Silver et al. 2016, Nature), MONTE CARLO TREE SEARCH (MCTS) explores a game tPer Daniel Harabor's follow-up work and the public literature, JPS+ (the offline variant) Per Daniel Harabor (2011 AAAI paper), JPS (Jump Point Search) accelerates A* on UNIFORM-COIn tactical AI, an INFLUENCE MAP is best described as which data structure?In behaviour trees beyond sequence + selector, a DECORATOR node typically does which?