Hello Greg, thank you for your reply and for your great expertise.
Through usage, I got the idea that the fan charts quit after 11 generations is because to go back even 12 generations, the font to identify next oldest generation would not be legible because the print would have to be too small.
Your suggestion as to how to proceed is exactly what I have been doing. The problem is, with so many ancestors being available at the 11th generation level, iterated multiple times, it becomes a hit-and-miss needle-in-a-haystack effort as to which ancestor at the 11th level has the richest family tree going back another 11 generations, and so forth. This cannot be done rapidly when you have multiple ancestors at the11th of the 11th of the 11th generation, etc., going back around 74 generations. Yes, you can conduct a systematic search, but it is hit and miss without knowing which ancestors will have nested fan charts that go back the farthest.
Even an indicator of a "1" or a "0" on the outside of each ancestor in a fan chart would help to save time, where
1 = "at least 11 more generations beyond this one" and
0 = "this ancestry does not go back to 11 generations, i.e. 10 or fewer"
This would at least help to flag the dead ends.
Having a background in computer science, I am aware that a computer can be programmed to follow each possible pathway that goes back the farthest in time, and to report the number of generations beyond the 11th on the outside of the fan chart, using a systematic algorithm. Once written, this search can be made relatively rapidly compared to what a human could do. I do not know how to modify the existing program to insert the algorithm, so I cannot advise about that, but these kinds of branching searches in networks should not pose any particular problem for an appropriately powerful computer.
This is a problem related to graph theory and social-network analysis, which may be of interest to academia. It seems to me that about a decade ago, there was interest in this area at the University of California at Irvine, under contract to DARPA. The software may already exist, the problem being to find it without search for the needle in the haystack.
I understand that we are all volunteers here on WikiTree and that you probably don't have time to devote to software modification and testing at this level, but it would be a great help and I, for one, would greatly appreciate it.