-
**Issue:**
- the vEB tree cascades down to leaf nodes with universe sizes of 2 (1 bit)
- this is very inefficient; bitwise leafs can manage universe sizes up to 64 with intrinsic operations in O(1) …
-
Projekti kloonattu 17.8. klo 13.10
### Ohjelman toiminta
Ohjelman toiminnassa ei noussut esiin oikeastaan mitään ongelmia. Peli toimii odotetusti, eli sitä voi pelata tietokonetta vastaan, ja tek…
-
At this stage everything's ready to start writing the chess pieces!
Remember:
> We're writing an object-oriented chess codebase not only because we want to practice software development skills b…
-
At this stage everything's ready to start writing the chess pieces!
Remember:
> We're writing an object-oriented chess codebase not only because we want to practice software development skills b…
-
Right now, only pawns mark flags that denote a capture. We should do this for the other pieces too, it'd simplify some things when writing an `apply_move` function
-
> https://lichess.org/tXLCGzpvIn
the last position, white's time ran out and it was ruled that black won. However, a checkmate can't be reached with a series of legal moves. Therefore, according to…
-
Currently, when Miri raises an error while evaluating a `const`, that does *not* lead to a hard compiler error (`sess.struct_err` or so). Instead, the `const_err` lint is emitted (and there are a bunc…
-
At this stage everything's ready to start writing the chess pieces!
Remember:
> We're writing an object-oriented chess codebase not only because we want to practice software development skills b…
-
The transcription from PHP Chess to TypeScript Chess has already started. The main purpose of it is to check out how similar PHP and TypeScript can be as OOP languages.
Remember:
> We're writing…
-
The transcription from PHP Chess to TypeScript Chess has already started. The main purpose of it is to check out how similar PHP and TypeScript can be as OOP languages.
Remember:
> We're writing…