diff --git a/src/components/BulgarianSolitaire.tsx b/src/components/BulgarianSolitaire.tsx index d61dfa8..1e59982 100644 --- a/src/components/BulgarianSolitaire.tsx +++ b/src/components/BulgarianSolitaire.tsx @@ -298,7 +298,7 @@ const BulgarianSolitaire: React.FC = ({ showSocialShare

Bulgarian Solitaire

Choose a number n, then drag the {totalBoxes} boxes into columns. - Click "Play" to simulate the Bulgarian Solitaire process where one box is taken from each non-empty column to form a new column, continuing until reaching the triangular configuration (1, 2, 3, ..., n). + Click "Play" to simulate the Bulgarian Solitaire process where one box is taken from each non-empty column to form a new column. Will this process always converge?