Week 1: Maze Solving - Hsanokklis/2023-2024-Tech-journal GitHub Wiki

For this assignment, we will be finding solutions for navigating mazes. Because we need to test our solutions, we will need to express our algorithm in a language a computer can follow.... this means we need to write a program.

Remember, algorithms describe processes in the abstract. Programs look a lot like algorithms but their language is formalized to a specific programming language. There is either a "compiler" or "interpreter" that converts these programs into a machine language that the computer understands. While most of the programming we will do in this course will be in Python, we will be further exploring the Maze concept that we previously discussed in a more visual language, called "blockly".

You can control the blocks simply by picking them up and repositioning them. Unlike the maze solutions we explored earlier, you cannot draw marks in the maze or act randomly. The programs you make need only solve the specific maze you are looking at.

There are 10 Mazes. When you have a solution for each maze, click the image of the chain link. Copy and paste the URL for your solution into the corresponding Quiz question. I strongly recommend that you copy and paste the URLs in a local document on your computer first... then, when you finish solving the mazes, you fill out the quiz. This will help you avoid losing work due to the quiz timing out or a some other type of hiccup.

Make sure you have done the readings for the week. The solution to Maze #10 is the "right wall follower" algorithm from the reading!

Maze 1