15-Peg Solitaire: Brute Force vs. an SMT Solver
Stop telling the computer how to search. Tell it what a win looks like. Solving the Cracker Barrel peg game by brute force, then with the Z3 SMT solver.
#computer science
Content tagged with "computer science"
Reimagining Claude Shannon’s Theseus in Rust
A little Q-learning, a perfect maze, and two mice running in WebAssembly. How I rebuilt Claude Shannon’s 1950 Theseus mouse in Rust, with a live demo.
Learning Regular Expressions
Don’t fear the regex! Learn regular expressions from the building blocks up: quantifiers, grouping, alternation, anchors, and greediness, plus tools and books.
CS317: Introduction to Design & Analysis of Algorithms
UAH CS317: complexity analysis, searching, sorting, graph algorithms, divide & conquer, dynamic programming, backtracking, and P versus NP.
CS403: Introduction to Formal Languages & Automata Theory
UAH CS403: finite automata, regular expressions, grammars, pushdown automata, Turing machines, and the halting problem, built up one model at a time on paper.
CS603: Formal Languages & Automata Theory
UAH CS603, graduate formal languages and automata: DFAs, NFAs, regular languages, grammars, pushdown and linear-bounded automata, decidability.