looking for 'how to create' a game search tree. Note: not how to evaluate, walk, score, or prune an existing tree. This is needed for my chess program where it is easy enough in arrays for me to create a 2 ply tree of 60 possible moves or 60 * 60. When I go to 5 ply, 60 * 60 * 60 * 60 * 60, these numbers get impossible for memory and other 'tricks' or methods are needed. In my web based research there are 1000's of articles on the optimum methods for searching a tree, even a few for creating a tree like in tac-tac-toe. Does anyone know of a large tree creation method, guessing that part would fit in memory at any one time? Simple pseudo code or web references appreciated. Thanks.