Solving Puzzles Solutions Puzzle 1: Word Search Sample Algorithm:

Slides:



Advertisements
Similar presentations
Solving problems by searching
Advertisements

CREATED BY: CALVIN WILLIAMS Bidirectional Search.
College of Information Technology & Design
SECTION 2-3 Mathematical Modeling – Triangular Numbers HW: Investigate Pascal’s Triangle o Write out the first 8 rows o Identify the linear, rectangular.
Problem Solving.
M May If there are 25 guests, how many handshakes altogether? At a party every guest shakes hands with every other guest once. How many triangles?
Searching Algorithms Finding what you are looking for.
B ACKTRACK SEARCH ALGORITHM. B ACKTRACKING Suppose you have to make a series of decisions, among various choices, where You don’t have enough information.
Operations Research Assignment Problem.
Problem of the Day Problem of the Day next Geometry - Connect the Dots
Secret Fortress Construction Challenge Name(s): _______________________ You should have two identical LEGO block kits. Set the extra kit aside, and use.
Chapter 10 Recursion. Copyright © 2005 Pearson Addison-Wesley. All rights reserved Chapter Objectives Explain the underlying concepts of recursion.
Building a Concept Map.
y=3x Find y if x=3 2. Find y if x= -2
Grid References To be able to find places on the map using 4 figure and 6 figure grid references.
Create a Crossword. You should have 24 personal vocabulary words from your reading of Chew on This. You will use at least 20 of them to make a crossword.
Warm Up #5. HW Check 22) y 0 24) x -2 26) w ≤ ½ and w ≥ -7/2 36) x = 16/3 or -14/3 38) X = 13/8 40) x = 11/8 42) X = -71/36 44) x ≤ 26/3 and x ≥ -6 46)
 Solving inequalities follows the same procedures as solving equations.  There are a few special things to consider with inequalities: ◦ We need to.
4.2 – GRAPHING LINEAR EQUATIONS ALGEBRA 1(A/B) FALL 2012.
Section 1.3 Problem Solving 1. Steps to world problem solving process 1.Understand the Problem 2.Devise a plan 3.Carry out the plan 4.Look back 5.MAKE.
Solving Systems of Equations: Elimination Method.
3.6 Graph Rational Functions Part II. Remember Rational functions have asymptotes To find the vertical asymptote, set the denominator = 0 and solve for.
Solving Puzzles Name(s): _______________________ Puzzle 1: Word Search
Words may be in any direction: Horizontal, diagonal, vertical, reverse.
Artificial Intelligence Lecture 9. Outline Search in State Space State Space Graphs Decision Trees Backtracking in Decision Trees.
Problem Solving and Mazes
Step 2: Solve the 1st side/layer
Warm-up for 2.4 Deductive Reasoning
Today We Will: 1. Enroll you in class and make sure you’re in the right place. 2. Find out who you are and who I am 9/4/12 – Welcome! BR: What is the MIKVA.
Linear Equations 02/11/12 lntaylor ©. Table of Contents Learning Objectives Graph linear equations with slope intercept method Graph linear equations.
Recursion. Recursive Methods HAVE: 1.A base case or termination condition that causes the method to end 2.A non-base case whose actions move the algorithm.
Chapter 4 Recursion. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.1-2 Chapter Objectives Explain the underlying concepts of recursion.
Problem Solving and Mazes
Mental Starter: to solve mathematical problems or puzzles How many sticks have I used to make these two squares? How many sticks will I need to make 4.
BACS 287 Programming Logic 1. BACS 287 Programming Basics There are 3 general approaches to writing programs – Unstructured – Structured – Object-oriented.
Sigma Notation A compact way of defining a series A series is the sum of a sequence.
SECTION 2-3 Mathematical Modeling. When you draw graphs or pictures of situation or when you write equations that describe a problem, you are creating.
1 Recursion Recursion is a powerful programming technique that provides elegant solutions to certain problems. Chapter 11 focuses on explaining the underlying.
Freehand Sketching. Draw a horizontal line about 70 mm long, and then another six lines underneath, each separated by about 10 mm.
EMSA Testing Strategies Foldable.  It’s Easy! Just remember  CUBES How can I do well on the test??
Do Now 1)Use the graph to find the solution to the system. x – y = 5 3x + y = 3.
Solving Addition and Subtraction Equations Lesson 6-2 Page 225.
Introduction To Slope. Slope is a measure of Steepness.
February 11, 2016Introduction to Artificial Intelligence Lecture 6: Search in State Spaces II 1 State-Space Graphs There are various methods for searching.
Problem Solving 1. Steps to world problem solving process 1. Understand the Problem 2. Devise a plan 3. Carry out the plan 4. Look back 5. MAKE SURE YOU.
Unit 2 Day 4 FOCS – Human Computer Interaction. Journal Entry: Unit #2 Entry #4 Using the numbers 3, 5, 8, and 9 and any mathematical operation you wish,
Understand the Coordinate Plane as Horizontal and Vertical Number Lines… 6.NS.C.6b.
Handshakes Unit 2, Days 4-6.
9/26/2015.  What do the steps in the problem solving process mean? 1. Understanding the problem. a. What data or information is known? b. What is unknown?
Shared Mathematics Working together (talking / sharing) Working at centres Using manipulatives Explaining / justifying Answering “How do I know?” Independent.
Solving problems by searching Chapter 3. Types of agents Reflex agent Consider how the world IS Choose action based on current percept Do not consider.
Name:______________________ Date:___/___/___ Class:________
Solving problems by searching
What do these people have in common?
Solving a Maze using Graph Algorithms
5.8 Rational Zero Theorem.
3-2 Graphs of Linear Equations in 2 Variables
Java Software Structures: John Lewis & Joseph Chase
The MIDDLE Layer Lesson 4.
Applied Combinatorics, 4th Ed. Alan Tucker
Gaming with conditionals
Applied Combinatorics, 4th Ed. Alan Tucker
Geometry Unit 12 Distance and Circles.
Stack Applications Lecture 29 Thu, Apr 5, /23/2019
Gaming with conditionals
Stack Applications Lecture 29 Thu, Apr 1, /29/2019 Stacks.
David Kauchak CS51A – Spring 2019
Backtracking, Search, Heuristics
Presentation transcript:

Solving Puzzles Solutions Puzzle 1: Word Search Sample Algorithm: Pick a word from the list of words you need to find. Go through each of the letters in the grid one by one and see if it’s the same letter as the first letter of the the word you’re trying to find. If it is, check its 8 neighboring letters (up, down, left, right, and 4 diagonals) to see if it’s the second letter in the word you’re trying to find. Then, check for the 3rd, 4th… letters until you’ve found all of the letters that make the word. Go to step 3. If it’s not, go back to step 2 and keep going through the grid of letters. Cross out the word you’ve just found and move onto the next word. Repeat steps 1-3 until you’ve found and crossed out all of the words on your list. Algorithms may vary, but the idea is that they should have a series of “foolproof” steps that anyone would be able to follow to solve the puzzle.

Solutions Puzzle 2: Number Maze Steps 1-4 Steps 5-8 Sample algorithm: Start at the goal and look at all the tiles in its horizontal and vertical paths. For each tile, see if it contains the correct number of steps to get to the goal. For each tile that works, check its horizontal and vertical paths for tiles that contain the right number of steps to get to it. Repeat until one of the tiles you get is the start tile. You now have a reverse sequence of tiles, from goal to start. Reverse the path to get the sequence of tiles from start to goal.

Name(s): _______________________ Puzzle 3: How many handshakes? Each dot represents a person, and all the dots must be connected to one another with no repeats: Instructions may vary, but here’s one set of instructions that works: Have everyone stand in a circle The first person should go around the circle and shake every other person’s hand. The next person should go around the circle and shake every other person’s hand except for the first person. The next person should go around the circle and shake every other person’s hand except for the first two people. The next person should go around the circle and shake every other person’s hand except for the first three people. Repeat, with each successive person going around the circle to shake everyone else’s hand until you get to the second-to-last person, who will shake one hand and complete the handshakes required.

Name(s): _______________________ Puzzle 3: How many handshakes? Number of People Number of Handshakes 2 1 3 4 6 5 10 15 7 21 8 28 9 36 47 Extra Credit: If there were 20 people at the party, it would take 190 handshakes Extra Credit: If there were N people at the party, there would be handshakes [(N-1)] + [(N-1) – 1] + [(N-1) – 2] + …. + [(N-1) – (N-2)] + [(N-1) – (N-1)] = (N-1) + (N-2) + (N-3) + …. + 2 + 1 + 0 = (N-1) + (N-2+1) + (N-3+2) +…. = (N-1) + (N-1) + (N-1) + …. =