Search vs. Lookup

• Once you've searched a tree, you can cache away the moves.
• Is it faster to have some moves cached away? Sure, it's really quick.
• In chess, even the non-computing part, these are known as opening moves.
• A good chess algorithm (and a good player) has remembered a vast number of openings.
• These typically go several moves in, but sometimes can go 35 moves.
• You can replay classic games.
• You can also take advantage of this technique generally.
• If you've spent a lot of computation to get an answer, you might want to store that answer so that it can be reused.
• In chess, this also works for end games.
• That leaves the middle part, which is still interesting.