 Though such additions meant that the program did not truly examine every node within its search depth (so it would not be truly brute force in that sense), the rare mistakes due to these selective searches was found to be worth the extra time it saved because it could search deeper.In that way Chess programs can get the best of both worlds.Many other optimizations can be used to make chess-playing programs stronger.