You play White, and Jev plays Black. Rather than asking an LLM to generate move strings or JSON, the backend feeds all server-validated legal candidate moves into Vercel AI SDK's experimental_evaluate(). Jev picks Black's move and outputs its probability distribution across all legal candidates in a single forward pass (~300ms, ~$0.00004/move).

Github link: https://github.com/qibinlou/jev-chess

Give a try and let me know your thoughts! I am having lots of fun coming up with different chess strategies for Jev to try out.

But it is essentially playing bullet chess right? No time to reason and is basically forced to go with it's knee jerk reaction. So maybe it plays reasonably against another average bullet chess player?

This is an instructive demo and makes me pause a bit when thinking about where I would trust using a classifier like this. Also there is no way to fine tune it right? So you are just left to its interpretation of the classification schema?

Building classifiers is hard and forces you into thinking about your problem space and your comfort level with type1 or type2 errors. I fear this will encourage sloppy work because all those decisions are black boxed.

Not like we were in a utopia careful ML applications before this.