We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8948d42 commit c6be9ccCopy full SHA for c6be9cc
README.md
@@ -6,7 +6,7 @@ available through a probing function call interface. For use in
6
chess programs and provided under a 2-clause BSD-style license. See
7
the file `LICENSE' for details.
8
9
-This implementation is quite fast because it handles the superpostion
+This implementation is quite fast because it handles the superposition
10
of possible black king locations per step.
11
12
```
@@ -41,7 +41,7 @@ Marcel
41
* If the table is not generated yet, this will be done
42
* automatically at the first invocation.
43
*/
44
-int kpkProbe(int side, int wK, int wP, int bK);
+int kpkProbe(int side, int wKing, int wPawn, int bKing);
45
46
/*
47
* Generate the KPK table.
0 commit comments