https://github.com/matmoore/stationhop

How many stations do you need to visit on the london underground, so that the letters cover all letters of the alphabet?
https://github.com/matmoore/stationhop

dynamic-programming puzzle

Last synced: 22 days ago
JSON representation

How many stations do you need to visit on the london underground, so that the letters cover all letters of the alphabet?

• Host: GitHub
• URL: https://github.com/matmoore/stationhop
• Owner: MatMoore
• Created: 2015-07-26T11:24:28.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2018-12-24T23:39:03.000Z (about 6 years ago)
• Last Synced: 2024-10-28T10:46:12.907Z (2 months ago)
• Topics: dynamic-programming, puzzle
• Language: Python
• Size: 4.88 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README

Awesome Lists containing this project

README

        
How many stations do you need to visit on the london underground, so that

the letters cover all letters of the alphabet?

This algorithm uses a dynamic programming approach.

If it's correct, the best solution is:

  *  St John's Wood

  *  West India Quay

  *  Vauxhall

  *  Finchley

  *  Belsize Park

  *  Ealing Common