From 90a0780d05361a1b55e669f83fc8f48484bdf92c Mon Sep 17 00:00:00 2001
From: Marc-Antoine Manningham <marc-antoine.m@outlook.com>
Date: Sat, 14 Sep 2024 23:42:54 -0400
Subject: [PATCH] chore: add name of algorithm

---
 combinatoric-solver/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/combinatoric-solver/README.md b/combinatoric-solver/README.md
index 21c1771..4da455b 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)
-- 
GitLab