title: Would a minmax / negamax tree perform significantly better if the stored states contained little information?
body: <p>I'm working on a chess AI and have concerns for the performance later down the road.<br>
  Right now, my negamax tree contains every game state as you would expect, though each state stores the entire board in ASCII form, along with the fitness and methods.<br>
  Would the tree perform better if I were to trim the stored information down to, say, just the moved piece? 
  For example, instead of storing the entire ASCII board, store just "b2a2" (b2 moved to a2). 
  Thanks.</p>