-
-
Since this hasn't really been brought up before, I would like to suggest the possibility of Static BitArrays. In particular, since the performance of static arrays relative to regular arrays are so cl…
-
For the information how the AI works right now, please look at [this article](https://mbuffett.com/posts/chess-ai/).
It would be kinda interesting to research if there are other (faster, more effic…
-
Another consideration: a board does not in general determine which player's turn it is, right? And a board B where it's black's turn is strategically inequivalent to B where it's white's turn, so we s…
-
-
The fastest way to sort a list: Have no list at all. Zero code = zero runtime.
There is a way to write a chess engine by directly building the wanted heuristics into the movegenerator itself and bra…
-
Swift 4.2 introduced random seeding for hashing so that hash values are really different each time the program runs.
The board initializer function in line 360 of `Board.swift` uses hash values as i…
-
**Suggestions:**
- make the pretraining on GM games data work
- don't try to achieve too much at one:
- reduce the training dataset to a minimum
- reduce the model to a minimum
- normalize in…
-
since piece list wasnt sorted it was changing during perft since pass by reference in java, ie quick fix for perft in mean time ArrayList pieces = (ArrayList)piecesArr[i].clone();
cant quite think o…
-
So far, the game logic / rules of chess are not yet fully implemented.
I think it would help to have one place to track all rule violations that have been found so far, because not all of them are …