Slime Mold Competition: Click to place food. Two competing slime molds (A & B) expand, grow, and fight for resources.
Slime Mold A (Purple) - Standard SMA Algorithm
Movement:
\( X(t+1) = X_b + v_b \cdot (W \cdot X_A - X_B) \) where:
- \( X_b \) is the best slime position (nearest food).
- \( W \) is a weight factor.
- \( v_b \) controls oscillation for food-seeking.
- \( X_A, X_B \) are randomly chosen nodes.
- If food is found, more nodes are generated.
Slime Mold B (Blue) - Mutated Algorithm
Movement:
\( X(t+1) = X_b + v_b \cdot (W \cdot X_A - X_B) + R \) where:
- **Mutation:** Additional random exploration \( R \sim U(-1,1) \).
- \( W \) is weaker, making food priority lower.
- Slime B spreads more, but less reinforcement.