https://github.com/neuring/rummy_to_sat

https://github.com/neuring/rummy_to_sat

Last synced: about 1 month ago
JSON representation

• Host: GitHub
• URL: https://github.com/neuring/rummy_to_sat
• Owner: neuring
• License: mit
• Created: 2021-05-22T17:21:19.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2021-05-24T16:37:35.000Z (about 3 years ago)
• Last Synced: 2024-02-11T14:04:51.497Z (5 months ago)
• Language: Rust
• Size: 38.1 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Lists

• awesome-rust-formalized-reasoning - rummy_to_sat - implementation of a solver for [Rummy](https://en.wikipedia.org/wiki/Rummy). (Unclassified / Libraries)

README

        
Implementation of a solver for [Rummy](https://en.wikipedia.org/wiki/Rummy)

Due to me growing up with a different version, this is using colors and numbers 1 to 13 instead of normal playing cards.

When called with a file containing a card specification like:

```

REQUIRED:

red 1

red 2

red 3

OPTIONAL:

yellow 4

red 4

blue 4

yellow 5

yellow 6

```

It will output the best possible arrangements using as many OPTIONAL cards as possible and all REQUIRED cards.