alantao912 / juliette Goto Github PK

We must know how many checks/captures there are in a move list. It may be convenient to create a "movelist" object backed by an array that also tracks additional information such as the number of checks, and the number of captures.

Replace current custom hash function with zobrist hashing and implement a transposition table.

Currently, there are two nearly identical functions to implement alpha-beta minimax. One for the minimizing side, one of the maximizing size. Use the relation: alphabeta(a,b) = -alphabeta(-b, -a) to convert to "negamax" therefore requiring less, more compact code.

Implement determination of game progression based on material remaining.

When considering different lines, worse lines are frequently swapped out for better lines. Create a data structure that is optimized to do this without dynamic memory allocation (slow) and excessive copying (also slow).

Tell the search algo to keep searching until there are no more captures or checks remaining. Then evaluate the position.

Different Positions could have duplicate hash codes. Therefore, whenever the repetition count hits three during draw verification, we must verify the move history to see if the position is actually drawn by three-fold repetition.

Hi Alan, since the readme suggests building on "Any UNIX derived OS", just wanted to point out a compilation error on macos (ventura 13.1):

src/util.h:140:16: error: definition of type 'stack_t' conflicts with typedef of the same name
typedef struct stack_t {
               ^
/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX.sdk/usr/include/sys/_types/_sigaltstack.h:48:33: note: 'stack_t' declared here
typedef _STRUCT_SIGALTSTACK     stack_t; /* [???] signal stack */

it seems some internal structure in the macos developer stack is also named stack_t. Would you consider wrapping in a namespace or renaming to support macos compilation?

Implement a custom data structure for the move list with counters storing data for the number of checks, and captures. This data structure should be optimized for swapping elements and popping back.

Implement 3 fold repetition -> draw rule into evaluation function. Incentivize repeating moves when evaluation is unfavorable.