Skip to content

Latest commit

 

History

History
68 lines (58 loc) · 2.87 KB

README.md

File metadata and controls

68 lines (58 loc) · 2.87 KB

Solved Historic Problems

A collection of solutions to various historic mathematical and computational problems implemented in different programming languages.

Problems List

Number Theory & Mathematics

  • The Josephus Permutation
  • The Chinese Remainder Theorem
  • Sieve of Eratosthenes
  • The Collatz Conjecture

Algorithms & Puzzle Problems

  • The Eight Queens Problem
  • The Hanoi Tower Problem
  • The Knapsack Problem
  • The Pancake Sorting Problem
  • The Lights Out Puzzle

Graph Theory & Optimization

  • The Bridges of Königsberg
  • The Chinese Postman Problem
  • The Traveling Salesman Problem
  • The Shortest Path Through a Maze

Probability & Game Theory

  • The Monte Carlo Method
  • The Secretary Problem
  • The Monty Hall Problem
  • The Birthday Paradox
  • The Prisoner's Dilemma

Distributed Systems & Computing

  • The Byzantine Generals Problem
  • The Two Generals' Problem
  • The Dining Philosophers Problem
  • The Dining Cryptographers Problem

Pattern Generation & Cellular Automata

  • The Gosper's Gun Problem
  • The Chaos Game

Structure

Each problem solution includes:

  • Problem description
  • Historical context
  • Dev note (old Implementation)
  • Solution
  • Test cases (sometimes)

Languages Used

Contributing

Feel free to add new solutions or improve existing ones!