I've seen perfect solvers of the game Connect 4 using various methods. The one that I saw uses alpha beta pruning. Is it possible for a human to learn to play Connect 4 perfectly like these solvers do? Using alpha beta pruning specifically isn't necessary.
It really isn't possible for two reasons.
First, yes, it is theoretically possible to construct the whole tree. You could then trim the tree to just show the "good" moves. But the tree would be enormous and much too large for a human to memorize (except for some trivially small version). The tree is so large that you couldn't move the "book" around with a wheelbarrow. ;-)
As a side note the fact that computer programs use alpha-beta pruning is a testament to how large the tree is. If the tree were "small" the computer program would just examine the whole tree and select only "good moves."
Second the branching at any node in the tree is far too complicated to derive some simple heuristic to derive the correct move. So there isn't some kind of parity function for example where you could "easily" calculate what the next move should be like you can calculate for Nim.