-
Notifications
You must be signed in to change notification settings - Fork 5
Steganography in chess games
jes/chess-steg
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
This is a tool to encode/decode short messages as chess games. Too unwieldy for large content, but I believe it technically has no limit on the amount of data it can encode as it ignores draw by repetition and the 50 move rule. Perhaps it can break in some situation where a player is left with playing a checkmate as his only legal move? This game encodes the text "Hello, world!": 1. e3 b6 2. b3 Bb7 3. Nf3 Bxf3 4. Bd3 e6 5. h4 g6 6. b4 h5 7. gxf3 c5 8. Bb2 a5 9. Rh3 e5 10. c4 Bh6 11. Be2 Ke7 { White resigns. } 0-1 More information in my blog post: https://incoherency.co.uk/blog/stories/chess-steg.html There is also now a (incompatible) Scala implementation of the same idea by someone called "carpetscheme": https://github.com/carpetscheme/scalachess-steg/ Please email [email protected] if you want.
About
Steganography in chess games
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published