Hacker Newsnew | past | comments | ask | show | jobs | submit | vigrant's commentslogin

The constraint is enforced at every move. Stockfish can never actually play against it. The only limitation is that its internal search tree imagines unconstrained future moves, which makes its evaluation slightly off and the engine effectively weaker. For the use case (handicapping for fun) that's an acceptable tradeoff

https://constrainedchess.vercel.app/?fen=2b1kb2%2F8%2F8%2F8%...


> The only limitation is that its internal search tree imagines unconstrained future moves.

Yes this is what I'm saying. Evaluation can be way more than just "slightly off" though and can make the evaluation MUCH weaker because it might go down "ply-routes" that aren't just suboptimal - they simply wouldn't work at all.

For example thinking it had a "move set" that lead to a checkmate but the final ply involves a bishop that is five squares away per my rule constraint mentioned earlier.

It's fine for fun but the statement that "Stockfish's skill level applies correctly" is not a true one at any moderate level of play. (above 1200 ELO).

That's why I suggested looking into Fairy which supports runtime rule variations.


So did some research....

Fairy would help with search tree accuracy but it's not expressive enough to cover everything, you can't encode "no captures for 5 moves" in an INI config. I'd still need the JS filtering layer for dynamic constraints, so you would end up in the same place with those cases.


Ah yeah that'll get complicated quickly. :( It'd be nice if stockfish or its variants exposed the "ply searcher" with some kind of a callback so you could quickly kill a ply based on your custom constraints.

When I was doing some research into rolling my own chess engine about 5 years ago I stumbled across this:

https://github.com/josefjadrny/js-chess-engine

But you'd have to modify its minimax search and now we're getting pretty deep down the rabbit hole. Either way, good luck!


Yup, you are right. I'll take a look at Fairy. Looks like there is a WASM version!


Nice, had no idea they'd ported it over to WASM. I've used the original Fairy to play Chinese chess in the past though and it worked great!


Just noticed the unmatched quote in the the title :(


I was playing around with the idea of difficulty ramping, the first celeb would be more famous than the 2nd and so on.

I also want to go back through each celeb and add in what single thing they are most well known for, so for Edward Teller for example, i'd put "the father of the hydrogen bomb".


Where are you getting the stats from? I wanted to build something related but more real time (I don't have an iphone to check out the app but i'm assuming you don't have real time box scores). http://www.nba.com/news/termsofuse.html#priv9 (6)


I'm getting hung up when trying to install the CUDA installer. I get the error "The driver installation is unable to locate the kernel source.".


When requesting your spot instance AMI, make sure the virtualization type is "hvm" instead of "paravirtual".


It's already hvm. Amazon says Kernel ID : - . Can it be the reason? Should we choose kernel manually?


Q1 2013


Yeah, that's the one.


lol ^ 10,000,000,000


lol * 10,000,000,000

lol ^ 10,000,000,000 is an insane amount larger. :)


It doesn't seem to work when you switch the order of the css selectors.


Both selectors have the same specificity, so the last one is applied. Add another class and the order won't matter.


Confused me for a second, but yeah your right.


What's stopping someone from making a craiglist like website with an awesome UI?


It's hard to compete with a site that is both free and "everyone" uses already. Both of those are very strong barriers to entry.


Very true.


The challenge in building a brand and an audience that Craigslist has assembled.

If you build it, doesn't automatically mean that they will come.


network effects


Sometimes nature takes the hard path. youtube.com/watch?v=cO1a1Ek-HD0


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: