From 0deb42134cb7f0ed6ec809c3de1052ab2dfe2235 Mon Sep 17 00:00:00 2001 From: tslil Date: Tue, 1 Jun 2021 15:20:48 -0400 Subject: Trying to make things faster I tried the following, but they all made things worse: - moving away from the singly-linked (tail tracking) list for actions by: + using an array zipper for a deque + using an array to poorly hold a floating deque - caching the results of generating move lists in the transposition table and then + copying the resulting list/zip/deque instead of generating it + applying the move-to-front without copying, but this made the search order worse. Presumably in this case shallower nodes were messing up the search tree with garbage moves? I think some of this is not supposed to happen, but i have just the right combination of poor evaluation function and naively ordered and cheap move generation that i'm in a local minimum here. --- include/actions.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'include/actions.c') diff --git a/include/actions.c b/include/actions.c index 374f4f9..4f226e1 100644 --- a/include/actions.c +++ b/include/actions.c @@ -386,7 +386,7 @@ static inline void list_append(action_list_t *list, const enum A_TYPE type, const int8_t loc, const uint8_t data0, const uint8_t data1) { - action_node_t *new = malloc(sizeof(action_list_t)); + action_node_t *new = malloc(sizeof(action_node_t)); // TODO: trap errno new->next = NULL; -- cgit v1.3.1