Conversation
Contributor
|
Wow! Reminds me of https://en.wikipedia.org/wiki/1K_ZX_Chess. |
Contributor
|
I pushed a couple of fixes. Also the script is currently 11 lines (but it looks easy to fix eg by using a runghc shebang.) |
Contributor
Author
|
Indeed, I did not count the shebang for some reason! |
Contributor
Author
I wonder how feasible it is to implement full chess (with an AI) under this challenge (without resorting to something like https://hackage.haskell.org/package/chessIO). |
Contributor
|
It sounds impossible.. and yet 80x10 is not far off 1K.. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This is a very primitive implementation of chess using only Prelude. Correctness of moves is not checked. End of game is not checked. But, it is playable, in the sense that it visualises the board after every move :)
Scholar's Mate:
