def get_default_num_descentes_dans_arbre():
    """
    UCT algorithm relies on Monte-Carlo Tree search. However, it differs from MCT because it works in a layered manner.

        repeat 'num_descentes_dans_arbre' times the following procedure:
            - Tree Down: a node is reached based on UCT search criteria,
            - Monte Carlo: the node board state is evaluated using num_tirages_MC samples,
            - Tree Up: the evaluation is propagated up in the search tree using UCT update rules for evaluations.

    """
    num_descentes_dans_arbre = 7
    return num_descentes_dans_arbre
