New hands-on subjects

Automata:

• Rule 110 & Rule 30 & Rule 90 & Rule 184
• Forest-fire model

Graphs:

• Algorithme de Dijkstra
• Travelling salesman problem
• Graph coloring

Encoding:

• Run-length encoding
• Huffman coding
• Lempel–Ziv–Welch
• Hamming code
• Vigenère cipher & Caesar cipher

Combinatorics:

• Eight queens puzzle. --> generalize for NxN
• Tower of Hanoi --> generalize for N disks.
• Magic square & Sudoku.
• Latin square.
• Look-and-say sequence.
• Gijswijt's sequence.
• Kolakoski sequence.
• Knapsack problem.

Geometry:

• Sierpiński carpet.
• Drawing:
  • Bresenham's line algorithm.
  • Xiaolin Wu's line algorithm.
  • Midpoint circle algorithm.
• Convex hull

Probabilities (-->simulation):

• Monte Carlo method: (parallelism) compute PI.
• Coupon collector's problem.
• Random walk.