Lookahead

Lookahead parser actions
Shift 1 onto stack on input 1 in anticipation of rule3. It does not reduce immediately.
Reduce stack item 1 to simple Expression on input + based on rule3.

Lookahead
Even beginners in Go can achieve lookahead of around 60 moves in specific cases such as ladders, while you'd have to be a grandmaster at chess to be able to look a meagre 10 moves ahead.

Lookahead (in Neural Networks). For neural networks time series analysis, the number of time steps ahead of the last input variable values the output variable values should be predicted.
See also, the Neural Networks.

Strategies such as Lam and Bacchus's which perform a greedy lookahead search only considering the possible addition of one new arc at a time can suffer from their myopic lookahead. [Xiang et al.

We can view the static evaluation function combined with lookahead search as simply a more accurate but computationally more expensive, heuristic function.

It beat humans by a technique known as 'lookahead' - that is, after every move was made it would work out every possible move it could make, then looked at every possible move the human player could make for each one and so on.

See also: Neural network, Variance, Distribution, Generalization, Likelihood