We'll learn what a graph is (hint: this kind is more like cities connected by roads than an x and y axis) and how we can find good paths in graphs. Then we'll see how we can represent a 15-puzzle as a graph and solve it by finding the right path. I'll provide the starter code, and you'll implement the graph search (in the Python programming language). This class should help you learn more about algorithms / computer science and how fun and useful they are. You'll see how graph general techniques can be applied to real world problems and have fun programming one yourself. See here (https://neighthan.github.io/graphs_and_games/eight_puzzle.html; just click play) for what this sort of puzzle looks like.

We'll learn what a graph is (hint: this kind is more like cities connected by roads than an x and y axis) and how we can find good paths in graphs. Then we'll see how we can represent a 15-puzzle as a graph and solve it by finding the right path. I'll provide the starter code, and you'll implement the graph search (in the Python programming language). This class should help you see how graph techniques could be applied to real world problems and have fun programming one yourself. See here (https://neighthan.github.io/graphs_and_games/eight_puzzle.html; just click play) for what this sort of puzzle looks like.

Sorting algorithms are a great introduction to computer science-style thinking. Join us to learn different ways to sort a list (of, e.g., numbers): slowly or very fast! See how even efficient algorithms can be beautifully simple and easy to understand. At the end, we'll implement some of these algorithms in Python (if you don't know any Python yet, I'll try to teach you, but that's not the focus of this class, so you'll be at a disadvantage. You can easily learn enough Python for this class, though! You can Google for a tutorial or use this one: https://www.learnpython.org/ (if you make it through the functions lesson, you should be set for class!)).