Commit Graph

132 Commits

Author SHA1 Message Date
1aa419392e adapt to brlib 0.3 2024-01-06 19:54:22 +01:00
558be57c58 update Makefile for brlib, bit_for_each new API 2024-01-01 09:56:09 +01:00
01c5765888 remove -DBIN_xxx from brchess source files. parts moved to ./test (TODO) 2023-12-13 21:30:39 +01:00
11d3501a35 copyright dates 2023-11-15 12:28:57 +01:00
48b5420830 Add check array in position structure 2023-07-25 06:54:33 +02:00
b855ba59aa do not generate moves in pvs() terminal nodes 2023-07-13 10:39:36 +02:00
20403a0795 improve search() and pvs() output 2023-07-13 09:49:02 +02:00
c7e2aec77c Move bitboards constants to bitboard.h 2023-07-13 09:48:16 +02:00
754b011d05 fix _moves_gen_eval_sort() 2023-07-12 21:34:04 +02:00
e2a3563fce use eval_simple() as base for eval() 2023-07-12 21:32:26 +02:00
d852e0bc1d adjust nodecounts, fix PVS 2023-07-12 21:31:27 +02:00
3de87daa5a bug fix in pos_dup() 2023-07-12 21:30:24 +02:00
b5ed42746e cosmetic changes 2023-07-12 21:29:51 +02:00
0ca495576d add simple_eval and pvs. DO NOT USE PVS (need to use simple_eval) 2023-07-11 22:24:26 +02:00
ed9b9cc646 add nodes_count and moves_{generated,counted} in pos struct 2023-07-11 22:22:33 +02:00
88d2d4061f add moves sort 2023-07-11 22:21:42 +02:00
9932a64c97 add pvs(), aka Principal Variation Search 2023-07-11 22:20:43 +02:00
af1f5db507 add BB flip_V and FLIP_H macros 2023-07-11 22:13:06 +02:00
d9f03acb02 fix piece color in move_do 2023-07-10 13:17:26 +02:00
65f1bef987 cleanup 2023-07-09 16:22:42 +02:00
48319cf21a add M_PR_NL option in move_print() 2023-07-09 15:53:57 +02:00
0b787c8a90 Add negamax function (no α β pruning) 2023-07-09 15:44:50 +02:00
4bca805404 add move_t forward decl. 2023-07-09 15:42:41 +02:00
0df87ff41c Add bestmove in pos struct, add pos_check() 2023-07-09 15:36:14 +02:00
120a459206 add pos_del function 2023-07-07 15:53:57 +02:00
7952a34c88 Add pos negamax function 2023-07-07 15:53:26 +02:00
12f972e152 move.c: Code cleanup, add promotion in move_do 2023-07-07 12:11:17 +02:00
183e9ef2be Improve move gen, delete ling pos, 3 steps moves generation 2023-07-07 02:21:14 +02:00
6f7a04cc89 Add move_do (dup position), remove &board in move struct 2023-07-06 12:22:26 +02:00
8857dec6cd cleanup 2023-07-02 12:15:22 +02:00
aa7cb11056 add FILE* output 2023-07-02 11:36:04 +02:00
09ceca44e5 pos: keep possibility to have opponent moves (NULL move) 2023-06-25 16:02:23 +02:00
1e4af66379 moge gen: all moves count as mobility 2023-06-25 16:01:13 +02:00
5bd8f9042a eval: add functions to get eval details 2023-06-25 15:56:36 +02:00
373a73cb52 eval_t is now s32 2023-06-25 15:55:12 +02:00
9c6830bc56 add inittial pos init function 2023-06-25 15:54:46 +02:00
1154f141c9 start bitboard integration 2023-06-22 16:08:57 +02:00
cb94ca52b9 rename to brchess 2023-06-22 16:07:16 +02:00
e1570fa34a latest brlib version 2023-06-21 14:36:45 +02:00
aaa9cb8690 switch to s8...s64 and u8...u64 integer notation 2021-11-20 19:22:57 +01:00
05a64ec742 simplify 0x88 macros / remove redundant chessdefs.h equivalent ones 2021-11-20 16:15:45 +01:00
6b2c1702f6 revert to color at LSB, to avoid easy mistakes
close #3
2021-11-19 12:15:53 +01:00
097dae84d6 Refuckulate castle_Q: forgot a pointer when copying from castle_K 2021-11-16 21:47:40 +01:00
da0ee468e0 add prpieces(): print position White & Black pieces list 2021-11-16 21:46:22 +01:00
bf520b6c71 fuckulated movegenerator into a good coregenerator
Need to test all edge cases for new position after move (castle/en passant/promotion).
En passant crashes, likely easy fix.
castle/promotion new position untested.

Yoda: A feature branch absolutely necessary was.
Me: With that Truth I agree.
2021-11-15 19:36:19 +01:00
96c342b3d4 add move generation + new node print functions 2021-11-15 19:33:37 +01:00
a28cd5c492 pod_dup(): duplicate also pieces list 2021-11-15 11:23:37 +01:00
f0e1836f2f add memstats / clear lists when new fen position 2021-11-14 16:03:36 +01:00
6dac938c76 bodichess.c: clean dead code. 2021-11-14 11:58:16 +01:00
5bf5d6bae9 bodichess main loop (move gen/eval/fen init/print pos/print moves) 2021-11-14 11:35:03 +01:00