Presentation is loading. Please wait.

Presentation is loading. Please wait.

The Knight’s Tour Graphs, Algorithms, Abstraction and Decomposition

Similar presentations


Presentation on theme: "The Knight’s Tour Graphs, Algorithms, Abstraction and Decomposition"— Presentation transcript:

1 The Knight’s Tour Graphs, Algorithms, Abstraction and Decomposition
Based on the work of Paul Curzon / CS4fn Mark Clarkson

2 Secret Objectives Understand the terms: Abstraction Modelling
Decomposition Generalisation Graph

3 The Knight

4 The Knight’s Tour The challenge:
Visit each space on the grid exactly once End up back at square one

5 Decomposition Break a big task into several smaller tasks
Instead of ‘visit all squares at least once’, break it down into a series of specific steps “Divide and conquer”

6 A different challenge Start and end at the hotel

7 Which is easier? Why?

8 Graphs A diagram of a system Made up of nodes and edges
Can be an extremely useful way of modelling a problem

9 Lateral Thinking

10 Lateral Thinking

11 Lateral Thinking

12 Lateral Thinking

13 Lateral Thinking

14 Lateral Thinking

15 Lateral Thinking

16 Modelling Create a representation of a system Hide unnecessary data
Reduce complexity

17 Modelling Create a representation of a system
Hide unnecessary data (e.g. physical steps between moves) Reduce complexity (e.g. having to jump over squares)

18 Generalisation There are many interpretations of this word
Replacing many things, with one thing e.g. functions, mail merge Adapting the solution for one problem, to solve another e.g. We turned Knight’s Tour into a graph - we can use the same idea elsewhere

19 London

20 London

21 London

22 London

23 London

24 A Graph

25 An Abstraction

26 Walking Times

27 Walking Times

28 Abstraction Modelling e.g. creating a graph
Decomposition e.g. listing the steps to find the solution Generalisation e.g. applying the same technique to a similar problem

29 Abstraction Modelling Decomposition Generalisation

30 Abstraction Modelling Ignore the physical distance between stations
Decomposition Find the steps you need to reach your goal Generalisation Use this for a different journey in London

31 Abstraction Modelling Ignore the physical distance between stations
Decomposition Find the steps you need to reach your goal Generalisation Use this for a different journey in London Or in Tyne & Wear

32 The Bridges of Königsberg
A similar challenge The Bridges of Königsberg


Download ppt "The Knight’s Tour Graphs, Algorithms, Abstraction and Decomposition"

Similar presentations


Ads by Google