Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

Version 1 Next »


 

In our experience of testing several trees against each other, it’s rare that one tree gets it all right, while the other trees get it all wrong. More often, we get one of the following situations:

  • One tree is the clear winner, substantially outperforming the other trees. But there are a few elements of the tree that didn’t work well, and need to be rethought.
    The other trees lost out, but our analysis identified certain elements in those trees that actually performed better than their counterparts in the winning tree.

  • No tree is the clear winner – they all had problems that kept their overall scores down.
    Like the case above, though, we were able to identify certain parts of each tree that performed well and should be pursued if possible.

In both cases above, we end up cherrypicking the best ideas from our candidate trees and creating a hybrid tree from those pieces:

  • If we have a winning tree, we keep its overall structure and try replacing its weak areas with the best ideas from the other trees.

  • If we don’t have a winner yet, we may need to create two or 3 hybrids to test in the second round, to see if we can come up with a winning structure.

  • example

 

This is often a difficult process, because some ideas are just not compatible with others. If tree A won the first round, but there are parts of tree B that did really better than their counterparts in tree A, it may not just be an easy copy-and-paste from B to A, because what worked in B may not work with the different approach that tree A takes.

  • example

 


Next: Rewording and replacing tasks

 

  • No labels