https://github.com/izzhafeez/mrt-puzzle
Here is the work done to build the solutions to the puzzle I've created for the NUS Math Society Puzzle Series Week 2.
https://github.com/izzhafeez/mrt-puzzle
Last synced: about 2 months ago
JSON representation
Here is the work done to build the solutions to the puzzle I've created for the NUS Math Society Puzzle Series Week 2.
- Host: GitHub
- URL: https://github.com/izzhafeez/mrt-puzzle
- Owner: izzhafeez
- Created: 2021-09-18T07:16:48.000Z (over 3 years ago)
- Default Branch: master
- Last Pushed: 2021-09-21T07:33:18.000Z (over 3 years ago)
- Last Synced: 2025-02-13T00:37:38.939Z (3 months ago)
- Language: Jupyter Notebook
- Size: 3.22 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# MRT-puzzle
Your train-loving friend is travelling to Singapore for the first time and wants to visit all the MRT interchanges (shown in the picture). However, he does not want to visit or pass through any station more than once. Furthermore, he wants to take each non-LRT (non-grey) train line exactly 3 distinct times during the journey. Can you help plan his route?
Assumptions:
You may only use the network and stations shown in the picture.
Two uses of the same line are considered distinct if they are separated by the use of another line.
The extensions to the Green and Yellow line connect to their main lines at Tanah Merah and Promenade respectively (i.e. it is impossible to travel from Bayfront to Dhoby Ghaut on the Yellow line without first passing through Promenade). Furthermore, Bedok to Tanah Merah to Expo constitutes one usage of the Green line.