# combinatorics
Combinatorics is the branch of mathematics concerned with counting, arranging and choosing — how many ways can something happen, and what patterns show up when you enumerate every possibility. This tag gathers the site's counting-and-arrangement puzzles: the Birthday Paradox — Probability Simulation demonstrates how quickly collision probability climbs in a group of people, N-Queens Problem is a classic constraint-satisfaction puzzle about placing non-attacking queens on a chessboard, and Graph Coloring explores how few colors are needed so that no two connected regions match. Pascal's Triangle (listed here as Pascal) and Catalan Numbers visualize two of the most famous integer sequences in combinatorics, while Inclusion-Exclusion Principle — Venn Diagrams & Counting and Combinatorics & Counting cover the underlying counting techniques directly.
Found: 8 simulations · 0 articles
🧪 Simulations (8)
Facts about this collection
- 8 combinatorics simulations are listed here, covering counting, probability and combinatorial puzzles.
- The Birthday Paradox appears twice under this tag, as Birthday Paradox — Probability Simulation and Birthday Paradox — Collision Probability, both linking to the same interactive page.
- N-Queens Problem and Graph Coloring are both classic constraint-satisfaction problems solved by search.
- Pascal (Pascal's Triangle) and Catalan Numbers each visualize a well-known integer sequence built from combinatorial counting rules.
Simulations in this topic include Birthday Paradox — Probability Simulation, Pascal, Graph Coloring, N-Queens Problem, Inclusion-Exclusion Principle — Venn Diagrams & Counting and Catalan Numbers.
Looking for more? Dive into the full library of 1000+ interactive, browser-based simulations, or browse every topic.