diff --git a/src/components/BulgarianSolitaire.tsx b/src/components/BulgarianSolitaire.tsx index bf55fea..d4a5d54 100644 --- a/src/components/BulgarianSolitaire.tsx +++ b/src/components/BulgarianSolitaire.tsx @@ -349,11 +349,12 @@ const BulgarianSolitaire: React.FC = ({ showSocialShare

Choose a number n, then drag the {totalBoxes} boxes into columns.
Note that one column can hold multiple boxes.
+ +
Click "Play" to simulate the Bulgarian Solitaire process.
Here one box is taken from each non-empty column to form a new column. -

- - Will this process always converge? +
+ Will this process always converge?

@@ -503,7 +504,7 @@ const BulgarianSolitaire: React.FC = ({ showSocialShare Akash Kumar - , who very kindly walked me through the convergence argument for triangular numbers found in{" "} + , who very kindly walked me through the argument found in{" "} Peter Winkler's