What are the differences between Chess and Go from the perspective of computers? Please list the differences between the game of Chess and the game of Go for engine programming in a similar format as this one:

Go:


Item 1
Item 2
...


Chess:


Item 1
Item 2
...
Chess: 


Chess programming pretty much consists of optimising the tree search. All attempts at introducing "human like knowledge" into the engines have been dropped for more and more sophisticated search heuristics. 
The ultimate goal in chess programming has been reached. In fact one could argue that chess programming overshot it's goal by a mile or two. Since the mid-2000s no human player stands a chance against the top engines. 


Go:


Apart from searching a search tree of possible variations the latest advances in go programming have included such divers techniques as Monte Carlo simulations and neural networks.
The best human players are still stronger than the engines, so arguably there is still more to accomplish.