diff --git a/combinatoric-solver/README.md b/combinatoric-solver/README.md
index 21c17715ee778f0be5d3ba657b5ccdd6b4108968..4da455b212cb9e2cd84ac201a8b10bd3f348da73 100644
--- a/combinatoric-solver/README.md
+++ b/combinatoric-solver/README.md
@@ -23,4 +23,4 @@ It function on the following assumptions:
 
 - It iterate recursively on all variants until it has a variant for each item.
 - If an incomplete collection doesn't respect the constraint the rest of combination will not be explored.
-- If an incomplete collection have a worst score than the worst of the best n scores, the rest of the combination of this collection will not be explored.
+- If an incomplete collection have a worst score than the worst of the best n collection, the rest of the combination of this collection will not be explored. (Branch and bound)