From the problem solvers perspective, it may help us to understand how DFS and solution trees can be used to build a chess solver or any other problem solver. The basic concept of the chess solver could be a strategy where a search tree can be implemented for each piece available on the board. In every solution tree, it will have a win/lose weight, once DFS is performed for every piece in a given stage of the game, the best move would be the solution tree that givesthe best possible outcome. Roughly speaking this is how the chess solvers work or any other problem solver where solution trees could be applied.
It's amazing to know that few decades ago brilliant minds like Alan Turing or Marvin Minsky had the knowledge to make the foundation for Artificial intelligence even if the resources like computers were not available in that time. I’m wondering what would be their accomplishments now that we have a lot of computer power.Well, I think we will never know it but one thing is for sure, the next generation is doing more research in this field and I’m sure that their new theories right now are being applied in fields like electric systems, data mining, economics, aircrafts simulators, etc.
Recently, these algorithms have been used to understand the code of the human genome and also they have been applied for astronomy research, self-driving cars, image recognition, etc. The illustration above shows a screenshot of my Sudoku solver where it solved a puzzle with 52 empty squares and it took 14,702 iterations to found the solution in 9 seconds.