Algorithms & Data Structures
Assignment: 1.3 Ozobot Shape Tracer
Browse to https://games.ozoblockly.com/shapetracer-basic and investigate the “line tracing games” there. After you become familiar with the coding tasks in “Shape Tracer 1,” browse to “Shape Tracer 2” –
https://games.ozoblockly.com/shapetracer-advanced and complete levels 1, 2, and 3. [home for these and others is, https://ozobot.com/create/challenges]
Using a screen capture app (and not your phone or camera), capture your code for each level after you successfully complete it. Ensure both your code and the path traced by the ozobot are visible in the screen capture.
Insert your screen images into a Microsoft Word data file. Save your file with the name assignment 1.3 and upload it here. Be sure your name is in the document and you have labeled the images with the level number.
Assignment: 1.4 Ozobot Programming
Using your Ozobot, create code, load it into the robot, and execute it to perform the following:
A – travel in a square
B – travel in two “back to back” triangles [imagine a crude bow tie shape]
C – travel in the shape of an infinity sign [imagine two crude circles back to back]
Upload your code pasted into a document here. You can test out your code before downloading it to your Ozobot (or in the absence of a real robot) by using the simulator https://games.ozoblockly.com/shapetracer-freeform or by using https://games.ozoblockly.com/shapetracer-advanced?… and “ignore” the challenge and just code the assignment
Assignment: 1.5 Search Trees
After you have thoroughly read sections 11.1 – 11.3 in chapter 11 of Computer Science: An Overview. Answer the following questions
A) Draw the search tree that is generated by a breadth-first search in an attempt to solve the eight-puzzle from the following start state without the assistance of any heuristic information. Continue the tree for 5 levels or until a solution is obtained.
1 3
4 2 5
7 8 6
B) Draw the search tree that is generated by the best-fit algorithm below in an attempt to solve the eight-puzzle from the state shown in the first problem if the number of tiles out of place is used as a heuristic. [the first heuristic]
C) Draw the search tree that is generated by the best-fit algorithm as detailed in the previous question in an attempt to solve the eight-puzzle from the following start state, assuming the heuristic used is as follows:
Measure the distance each tile is from its destination and add these values to obtain a single quantity. [the second heuristic]
1 2 3
5 7 6
4 8
D) When solving the eight-puzzle, why would the number of tiles out of place [the first heuristic] not be as good a heuristic as the one described in the question above [the second heuristic]?
