Fun fact: you can use this to play chess960 (i.e. fischer random chess), or any other "custom start position" variant, just by appending a FEN to the URL (replace spaces with underscores).
> Plain, brutalist, no bloat chess. Every page is only html and css. Every chess move is made by clicking a link. Send a link to your friend and they'll send you one back to make your move. No silly animations or slick interactivity to trip up your gameplay. When Google indexes this site will we successfully compute all possible chess moves?
> Functionality is quite limited, and things might be broken. Please let me know if you find bugs!
Not sure if the first paragraph boasts the pros or the cos of this
sort of implementation.
It's one thing to market implementations done in unusual ways with the intent of exploring the possible. It's another to portray software implemented with the right technologies as : bloat, silly animations, slick interactivity to trip up your gameplay.
It doesn't help that the second paragraph showcases shortcoming of this kind if implementation.
It could all just be sarcastic and I fell for your trap.
I suspect it's mostly "because it occured to me I could," which I think should always be an acceptable reason for building something slightly unusual.
I do rather like the idea of play via stateless link passing, though, and honestly the "prettiness" of animations and interactivity does not, at least to me, seem like a net advantage.
"the right technologies" is highly dependent on the user experience you're trying to achieve; in this case I think I'd argue that for the goal at hand, these -were- the right technologies, just like for the UX goals of more featureful sites a different bundle of technologies were the right thing too.
Yeah the idea that you wouldn't want animations in a GAME is hilarious. It must either be a joke or this person is really that far up the "the web shouldn't have js" culty asscrack.
This isn't really static right? It's still dynamically rendered by the backend each time you request the page. There aren't 999999919291293923 pre-rendered pages living on a server somewhere.
If checkmates actually said ‘checkmate’ on them you’d be able to find them once the Google bot has indexed the whole site.
Ideally every page needs to include a string summarizing every preceding board state leading up to it, so you can search for a current board state plus ‘checkmate white’ to find every possible way to win from a given board state.
Then all that remains to turn Google into the ultimate chess oracle is to persuade your opponent to make all the moves you found.
I imagine it would look closer to the Lichess database, which differs quite drastically from the Masters database. For instance, with the masters e4 is met with c5 in 46% of games, but on lichess c5 only happens in 19% of games.
I noticed a weird bug where sometimes the game will auto-move for a player. In particular, this seems to happen when one queen captures a piece, and the opposing side has the ability to capture that queen with their queen, the game automatically makes the 'queen takes queen' capture.
https://fav.farm seems like a cool service at first, but it doesn't actually do a whole lot. I'd just assume inline the one-liner they mention (similar to https://css-tricks.com/emoji-as-a-favicon/) and avoid the external dependency for the price of 117 characters.
This is great. Suggest one additional bit to show black at the bottom. That way the player of black is not handicapped by playing from an upside down position.
Or just rip off the chess piece design of this other minimalist chess board simulator, which is never upside down:
> When Google indexes this site will we successfully compute all possible chess moves?
How do spiders know when to stop spidering when they keep getting original content? I assume there's a Gordian solution to the Halting problem like a limit to bytes or seconds. But if you applied the same rules to ebay.com and val.town that doesn't scale.
Big spiders neither stop nor start. If each webpage gives you on average 200 new urls, you need to aggregate them, calculate ranks and schedule the top 0.5% for crawling. Crawling capacity is constant, the only question is the quality of your ranking formula.
There's a lot of heuristics. Big sites get more crawl time. Some crawlers will back off if pages are slow. There's usually some sort of 'interestingness' calculation, so repetitive content won't get crawled as much.
One of my personal projects uses a similar idea, but it's a word game (scrabble-like) and it's hosted statically: https://jcparkyn.github.io/scrobburl/
[+] [-] cmeacham98|1 year ago|reply
Example: https://chess.maxmcd.com/bbnqrknr/pppppppp/8/8/8/8/PPPPPPPP/...
[+] [-] onehair|1 year ago|reply
> Functionality is quite limited, and things might be broken. Please let me know if you find bugs!
Not sure if the first paragraph boasts the pros or the cos of this sort of implementation.
It's one thing to market implementations done in unusual ways with the intent of exploring the possible. It's another to portray software implemented with the right technologies as : bloat, silly animations, slick interactivity to trip up your gameplay.
It doesn't help that the second paragraph showcases shortcoming of this kind if implementation.
It could all just be sarcastic and I fell for your trap.
Well played and clever implementation!
[+] [-] Hugsun|1 year ago|reply
The limited functionality is nevertheless likely referring to features beside the ones described as bloat.
[+] [-] mst|1 year ago|reply
I do rather like the idea of play via stateless link passing, though, and honestly the "prettiness" of animations and interactivity does not, at least to me, seem like a net advantage.
"the right technologies" is highly dependent on the user experience you're trying to achieve; in this case I think I'd argue that for the goal at hand, these -were- the right technologies, just like for the UX goals of more featureful sites a different bundle of technologies were the right thing too.
[+] [-] tucnak|1 year ago|reply
[deleted]
[+] [-] helboi4|1 year ago|reply
[+] [-] peabnuts123|1 year ago|reply
[+] [-] tromp|1 year ago|reply
[1] https://github.com/tromp/ChessPositionRanking
[+] [-] cachvico|1 year ago|reply
[+] [-] cxr|1 year ago|reply
There are. They're just compressed with an application-specific compression approach.
[+] [-] unknown|1 year ago|reply
[deleted]
[+] [-] unknown|1 year ago|reply
[deleted]
[+] [-] unknown|1 year ago|reply
[deleted]
[+] [-] unknown|1 year ago|reply
[deleted]
[+] [-] throw9474|1 year ago|reply
https://chess.maxmcd.com/r1b1kRnr/p1ppB2p/n2P2p1/8/7P/1p6/PP...
Should say checkmate?
[+] [-] michaelmior|1 year ago|reply
[+] [-] jameshart|1 year ago|reply
Ideally every page needs to include a string summarizing every preceding board state leading up to it, so you can search for a current board state plus ‘checkmate white’ to find every possible way to win from a given board state.
Then all that remains to turn Google into the ultimate chess oracle is to persuade your opponent to make all the moves you found.
[+] [-] jtriangle|1 year ago|reply
[+] [-] daniel_levine|1 year ago|reply
[+] [-] whiskeytuesday|1 year ago|reply
[+] [-] SonOfLilit|1 year ago|reply
[+] [-] dullcrisp|1 year ago|reply
[+] [-] unknown|1 year ago|reply
[deleted]
[+] [-] theolivenbaum|1 year ago|reply
[+] [-] eertami|1 year ago|reply
https://lichess.org/analysis#explorer
I imagine it would look closer to the Lichess database, which differs quite drastically from the Masters database. For instance, with the masters e4 is met with c5 in 46% of games, but on lichess c5 only happens in 19% of games.
[+] [-] zzh8829|1 year ago|reply
very cool, made it all the way to a checkmate
[+] [-] make3|1 year ago|reply
[+] [-] afauroux|1 year ago|reply
- [Try it](https://afauroux.github.io/chess/) - [Fork it](https://github.com/afauroux/chess)
[+] [-] angry_albatross|1 year ago|reply
[+] [-] pushedx|1 year ago|reply
[+] [-] javier_cardona|1 year ago|reply
[+] [-] daniel_levine|1 year ago|reply
[+] [-] carom|1 year ago|reply
For example - https://chess.maxmcd.com/rnbqkbnr/ppp1pppp/8/3p4/3P1B2/8/PPP...
[+] [-] lxe|1 year ago|reply
[+] [-] ggorlen|1 year ago|reply
[+] [-] swyx|1 year ago|reply
[+] [-] mode80|1 year ago|reply
Or just rip off the chess piece design of this other minimalist chess board simulator, which is never upside down:
https://mirrorchess.com/
(It's ok, I made it.)
[+] [-] jmpavlec|1 year ago|reply
[+] [-] delichon|1 year ago|reply
How do spiders know when to stop spidering when they keep getting original content? I assume there's a Gordian solution to the Halting problem like a limit to bytes or seconds. But if you applied the same rules to ebay.com and val.town that doesn't scale.
[+] [-] alexey-salmin|1 year ago|reply
[+] [-] SonOfLilit|1 year ago|reply
[+] [-] toast0|1 year ago|reply
[+] [-] porphyra|1 year ago|reply
[+] [-] ziml77|1 year ago|reply
[+] [-] zazaulola|1 year ago|reply
https://js1k.com/2010-first/demo/750
[+] [-] dsizzle|1 year ago|reply
[+] [-] _factor|1 year ago|reply
[+] [-] tr3ntg|1 year ago|reply
[+] [-] Mr_Minderbinder|1 year ago|reply
[+] [-] jcparkyn|1 year ago|reply
Repo: https://github.com/Jcparkyn/scrobburl