#ifndef TREE_H
#define TREE_H

#include <stdint.h>
#include <stdlib.h>
#include <stdalign.h>

typedef enum {
	NODE_ACTION,
	NODE_CHANCE,
	NODE_TERMINAL
} NodeType;

typedef struct PublicNode {
	NodeType type;
	uint8_t active_player;
	uint8_t num_children;

	struct PublicNode** children;

	//for action nodes only
	alignas(32) float* regret_sum;
	alignas(32) float* strategy_sum;

	//for chance nodes
	int* dealt_cards;
	float* chance_weights;
} PublicNode;

typedef struct {
	uint64_t board;

	int pot;
	int p1_stack;
	int p2_stack;

	//chips put in by respective player
	int p1_commit;
	int p2_commit; 

	uint8_t active_player; //0 = P1 (OOP), 1 P2 (IP)
	uint8_t street; //0 flop, 1 turn, 2 river
	uint8_t raises_this_street; //cap betting, 3 per street likely
	uint8_t num_actions_this_street;
	uint8_t last_action_was_fold;
} GameState;

typedef struct {
	uint8_t* memory;
	size_t capacity;
	size_t offset;
} Arena;

void arena_init(Arena* a, size_t size);
void arena_reset(Arena* a);
void* arena_alloc(Arena* a, size_t size);

PublicNode* build_public_tree(Arena* arena, GameState state, int num_buckets);

int generate_bet_sizes(GameState* state, int* out_actions);
GameState apply_deal(GameState current_state, int card_idx);
GameState apply_bet(GameState current_state, int action_amount);

#endif //TREE_H