https://github.com/darkriszty/phonedialknightchess
https://github.com/darkriszty/phonedialknightchess
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/darkriszty/phonedialknightchess
- Owner: darkriszty
- Created: 2020-09-23T10:42:38.000Z (over 4 years ago)
- Default Branch: master
- Last Pushed: 2020-09-23T10:45:00.000Z (over 4 years ago)
- Last Synced: 2025-01-17T15:40:56.909Z (3 months ago)
- Language: C#
- Size: 5.86 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# PhoneDialKnightChess
Sample toy app for an algorithmic problem.
```
Imagine you place a knight chess piece on a phone dial pad. This chess piece moves in an uppercase "L" shape.
Every time the knight lands on a key, we dial that key and make another hop. The starting position counts as being dialed.
How many distinct numbers can you dial in N hops from a particular starting position?
```