https://github.com/bd2720/stringer

A tale of two strings.
https://github.com/bd2720/stringer

Last synced: about 1 month ago
JSON representation

A tale of two strings.

• Host: GitHub
• URL: https://github.com/bd2720/stringer
• Owner: bd2720
• Created: 2024-08-08T00:23:20.000Z (5 months ago)
• Default Branch: main
• Last Pushed: 2024-08-08T01:08:57.000Z (5 months ago)
• Last Synced: 2024-08-08T03:25:49.242Z (5 months ago)
• Language: Python
• Size: 3.91 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Stringer

A tale of two strings.

## Goal of the game

Given a staring word (string), final word, and operations with costs, can you find the cheapest path from the starting word to the target?

## Operations

There are six different operations, each with an associated cost. Each turn, you can perform one of the operations on your current string to try and get it closer to the target string. Intermediate strings are NOT required to be valid words. Some operations are more direct than others, but it pays to be creative; fewer moves do not always equate to a lower cost!

### 1. Reverse - `reverse`

- Reverses the letters of the string.

-  `pots ==(reverse)==> stop`

- Cost: 3

### 2. Swap: `swap  `

- Swaps the letters at `` and `` (the first letter on the left is at position 1).

- `slain ==(swap 2 5)==> snail`

- Cost: 1

### 3. Shift: `shift `

- Shifts each letter to the right `` spaces (can be negative). Letters that shift past the end of the word wrap back around to the beginning.

- `sever ==(shift 3)==> verse`

- Cost: 2

### 4. Change: `change  `

- Increments the letter at `` by `` letters (can be negative).

- `spoke ==(change 4 7)==> spore`

- Cost: 4

### 5. Add: `add `

- Duplicates the letter at ``.

- `rots ==(add 2)==> roots`

- Cost: 3

### 6. Remove: `remove `

- Removes the letter at ``

- `proud ==(remove 4)==> prod`

- Cost: 2