Presentation is loading. Please wait.

Presentation is loading. Please wait.

Taxi Cab Geometry Non-Euclidian Counting Problem.

Similar presentations


Presentation on theme: "Taxi Cab Geometry Non-Euclidian Counting Problem."— Presentation transcript:

1 Taxi Cab Geometry Non-Euclidian Counting Problem

2 What is the shortest distance? What is the shortest distance from A to B? Let each edge of a square be 1 inch.

3 What is the shortest distance? What is the shortest distance from A to B if you have to stay on the grid lines? Verify by having 2 drawings. Explain how you know there isn’t a shorter distance.

4 How many shortest paths are there?

5 Problem Solving Skills Study a simpler problem and look for patterns.

6 1x systems For the 1x blocks, find the length of a shortest path and how many shortest paths there are. Note any patterns.

7 2x systems For the 2x blocks, find the length of a shortest path and how many shortest paths there are. Note any patterns.

8 3x systems For the 3x blocks, find the length of a shortest path and how many shortest paths there are. Note any patterns.

9 How many shortest paths are there?


Download ppt "Taxi Cab Geometry Non-Euclidian Counting Problem."

Similar presentations


Ads by Google