In the late 1950s, Allen Newell and Herbert Simon have implemented a practical example for the general problem solver in the domain of computer chess. The project was called NSS chess (Newell, Simon, Shaw chess) and it was using heuristics, a goal generator and macro actions for playing chess. The advantage is, that symbolic AI related algorithmd need less computational effort and the chess engine will run on slower computers very well.
Unfortunately, the original NSS software isn't available in sourcecode and the documents from that time are gone. So my question is if the concept was cloned by modern programmers? The idea isn't using a brute-force solver but become dependent on heuristics, STRIPS like symbolic planning and goal stacks.
 Chess programming Wiki, NSS chess program, https://www.chessprogramming.org/NSS