state_search_benchmark.cc File Reference

Reproducible benchmark suite for the state-space search framework. More...

#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <string>
#include <Knapsack.H>
#include <State_Search.H>
#include <tpl_array.H>
#include <tpl_sort_utils.H>

Include dependency graph for state_search_benchmark.cc:

Go to the source code of this file.

Functions
int	main (const int argc, char **argv)

Detailed Description

Reproducible benchmark suite for the state-space search framework.

Included cases:

• DFS/backtracking on N-Queens,
• branch and bound on a deterministic knapsack instance,
• Alpha-Beta on Tic-Tac-Toe with optional move ordering and TT.

The suite is deterministic and supports --validate for invariant checks, plus --json for tooling-friendly output.

Definition in file state_search_benchmark.cc.

Function Documentation

main()

int main	(	const int	argc,
		char **	argv
	)

Definition at line 998 of file state_search_benchmark.cc.

References Aleph::Array< T >::append(), Aleph::divide_and_conquer_partition_dp(), and options.