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

Slides:



Advertisements
Similar presentations
The Chinese Postman Problem Route Planning Map Colouring
Advertisements

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Cooperative Pathfinding
Liang, Introduction to Java Programming, Seventh Edition, (c) 2009 Pearson Education, Inc. All rights reserved Chapter 27 Graph Applications.
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
MIT and James Orlin © Introduction to Networks Eulerian Tours Hamiltonian Tours The Shortest Path Problem Dijkstra’s Algorithm for Solving the Shortest.
New Mexico Computer Science For All Introduction to Algorithms Maureen Psaila-Dombrowski.
Top-Down Design and Modular Development
Program Design CMSC 201. Motivation We’ve talked a lot about certain ‘good habits’ we’d like you guys to get in while writing code. There are two main.
University of Toronto Department of Computer Science CSC444 Lec05- 1 Lecture 5: Decomposition and Abstraction Decomposition When to decompose Identifying.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Dynamic Programming.
Top-Down Design and Modular Development. The process of developing methods for objects is mostly a process of developing algorithms; each method is an.
Connected Components Fun with graphs, searching, and queues.
1 CPSC 320: Intermediate Algorithm Design and Analysis July 28, 2014.
Lecture 13: 10/10/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.
Hexahexaflexagon Automata Paul Curzon Queen Mary University of London With support from Google,
Explorers need maps: Abstraction, representations and graphs Paul Curzon Queen Mary University of London
Data Structures and Algorithms in Parallel Computing Lecture 2.
The Travelling Salesperson Problem A salesperson needs to visit London, Nottingham, Manchester and Leeds, he lives in Birmingham. Find the shortest route.
Puzzle of Week 1 You have 2 identical straight pieces of rope. Each takes 1 hour to burn if you light it from 1 side (it doesn’t matter which one). Show.
Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Blind Searches - Introduction.
1 Data Structures CSCI 132, Spring 2014 Lecture 1 Big Ideas in Data Structures Course website:
M Clements Formal Network Theory. Introduction Practical problem – The Seven Bridges of Königsberg Network graphs Nodes & edges Degrees Rules/ axioms.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
The Problem A gallant and brave knight must traverse the lands to rescue the princess and claim his rightful place in the kingdom A Knight on a board.
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
CMPT 438 Algorithms.
3.1 Fundamentals of algorithms
UNIT 2 – LESSON 6 ENCODE AN EXPERIENCE.
Stage 11: Artist: Nested Loops
BTEC NCF Dip in Comp: Unit 01 Principles of Computer Science Lesson 01 – Computational Thinking Mr C Johnston.
Schedule for next 2 weeks
Introduction to Programmng in Python
Punch Card Sorting: Binary Radix Sort
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Games with Chance Other Search Algorithms
Mathematics & Path Planning for Autonomous Mobile Robots
Mergesort: The power of divide and conquer
Divide and Conquer Methodology
Data Structures: Segment Trees, Fenwick Trees
Graph Paper Programming
This unit is all about Puzzles Games Strategy.
Graph Paper Programming
Genome Assembly.
The Knight’s Tour.
Computational Thinking for KS3
GET READY SETTLER ACTIVITY
The Friendship Algorithm
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Solving Special Cases.
Global Challenge Walking for Water Lesson 2.
Euler and Hamilton Paths
Chap 4: Searching Techniques
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
POWER CHALLENGES Several Ways To Solve 7 CHALLENGES.
Global Challenge Walking for Water Lesson 2.
Computational Thinking
Global Challenge Walking for Water Lesson 2.
Top-Down Design & JSP Skill Area Part D
Multiply and Divide I can recall some multiplication
Games with Chance Other Search Algorithms
Computational Thinking
Software Design Lecture : 6
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Top-down technique / Stepwise Refinement and Algorithms
Presentation transcript:

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

Secret Objectives Understand the terms: Abstraction Modelling Decomposition Generalisation Graph

The Knight

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

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”

A different challenge Start and end at the hotel

Which is easier? Why? https://www.flickr.com/photos/hadesigns/2688188166/

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

Lateral Thinking

Lateral Thinking

Lateral Thinking

Lateral Thinking

Lateral Thinking

Lateral Thinking

Lateral Thinking

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

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)

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

London

London https://www.flickr.com/photos/doug88888/6451642447

London

London

London

A Graph

An Abstraction

Walking Times

Walking Times

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

Abstraction Modelling Decomposition Generalisation

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

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

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