How to release combinatorial enumeration through the "tree"?

Question

Python

Need help or advice (or where can I find more information):
I want to implement a computation tree (not sure how such algorithms are called correctly) in Python, namely, let's say I have 3 options for each node, and on each next one, perform a check: If for some option the limit of n/2 is reached, then it is forbidden to be selected (n: number of the current level). As a solution, in fact, the number of options "reached" to a given level.

Answer 1

Can you put a stupid Neo4j graph base to play with it?