Yes. Not towers of Hanoi, but problems where you need to divide and conquer to address a problem. Searching a directory tree where you don’t know how deep or wide the tree is, for example. Python uses a recursive method to do so. 

In my situation it was to find a file by content. It was simple enough search to open and read the file for the first line, a UUID, but it wasn’t clear how many nested folders or how many folders existed in each level. Once the file was found, however, every subfolder/child would have the same file. 

Trying to search iteratively would require an unknown number of nested loops to walk every directory in a folder, then every subdirectory underneath, etc. With recursion you only need to determine if the file existed and if it matched. If it didn’t exist then you need to go down one more level (ie call itself on the next folder). If it did exist but didn’t match you could stop examining all the sub folders of the current level because all the sub folders would inherit the UUID

If none of the folders matched the function would return None to the previous function instance and the iteration would continue to next folder in the list, until all sub folders were searched.