char * freecell_solver_user_current_state_as_string( void * user_instance, int parseable_output, int canonized_order_output, int display_10_as_t ) { fcs_user_t * user; user = (fcs_user_t *)user_instance; { #if (!(defined(HARD_CODED_NUM_FREECELLS) && defined(HARD_CODED_NUM_STACKS) && defined(HARD_CODED_NUM_DECKS))) fc_solve_instance_t * instance = user->instance; #endif return fc_solve_state_as_string( &(user->running_state.info), INSTANCE_FREECELLS_NUM, INSTANCE_STACKS_NUM, INSTANCE_DECKS_NUM, parseable_output, canonized_order_output, display_10_as_t ); } }
static void dump_pqueue ( fc_solve_soft_thread_t * soft_thread, const char * stage_id, PQUEUE * pq ) { int i; char * s; if (strcmp(soft_thread->name, "11")) { return; } printf("<pqueue_dump stage=\"%s\">\n\n", stage_id); for (i = PQ_FIRST_ENTRY ; i < pq->CurrentSize ; i++) { printf("Rating[%d] = %d\nState[%d] = <<<\n", i, pq->Elements[i].rating, i); s = fc_solve_state_as_string(pq->Elements[i].val, soft_thread->hard_thread->INSTANCE_FREECELLS_NUM, soft_thread->hard_thread->INSTANCE_STACKS_NUM, soft_thread->hard_thread->INSTANCE_DECKS_NUM, 1, 0, 1 ); printf("%s\n>>>\n\n", s); free(s); } printf("\n\n</pqueue_dump>\n\n"); }
char * freecell_solver_user_iter_state_as_string( void * user_instance, void * ptr_state_void, int parseable_output, int canonized_order_output, int display_10_as_t ) { fcs_user_t * user; fc_solve_instance_t * instance; fcs_standalone_state_ptrs_t * ptr_state; user = (fcs_user_t *)user_instance; instance = user->instance; ptr_state = (fcs_standalone_state_ptrs_t *)ptr_state_void; return fc_solve_state_as_string( ptr_state->val, INSTANCE_FREECELLS_NUM, INSTANCE_STACKS_NUM, INSTANCE_DECKS_NUM, parseable_output, canonized_order_output, display_10_as_t ); }
/* * The char * returned is malloc()ed and should be free()ed. */ DLLEXPORT int fc_solve_user_INTERNAL_perform_horne_prune( enum fcs_dbm_variant_type_t local_variant, const char * init_state_str_proto, char * * ret_state_s ) { fcs_state_keyval_pair_t init_state; fcs_state_locs_struct_t locs; int prune_ret; DECLARE_IND_BUF_T(indirect_stacks_buffer) fc_solve_init_locs(&locs); fc_solve_initial_user_state_to_c( init_state_str_proto, &init_state, FREECELLS_NUM, STACKS_NUM, DECKS_NUM, indirect_stacks_buffer ); { fcs_which_moves_bitmask_t which_no_use = {{'\0'}}; prune_ret = horne_prune(local_variant, &init_state, &which_no_use, NULL, NULL); } *ret_state_s = fc_solve_state_as_string( &(init_state.s), &locs, FREECELLS_NUM, STACKS_NUM, DECKS_NUM, 1, 0, 1 ); return prune_ret; }
/* * The char * returned is malloc()ed and should be free()ed. */ DLLEXPORT int fc_solve_user_INTERNAL_calc_derived_states_wrapper( enum fcs_dbm_variant_type_t local_variant, const char * init_state_str_proto, int * const num_out_derived_states, fcs_derived_state_debug_t * * out_derived_states, const fcs_bool_t perform_horne_prune ) { fcs_state_keyval_pair_t init_state; fc_solve_delta_stater_t * delta; fcs_encoded_state_buffer_t enc_state; fcs_state_locs_struct_t locs; fcs_derived_state_t * derived_list = NULL; fcs_derived_state_t * derived_list_recycle_bin = NULL; fcs_compact_allocator_t allocator; fcs_meta_compact_allocator_t meta_alloc; int states_count = 0; fcs_derived_state_t * iter; fcs_derived_state_debug_t * debug_ret; int idx = 0; DECLARE_IND_BUF_T(indirect_stacks_buffer) fc_solve_initial_user_state_to_c( init_state_str_proto, &init_state, FREECELLS_NUM, STACKS_NUM, DECKS_NUM, indirect_stacks_buffer ); delta = fc_solve_delta_stater_alloc( &(init_state.s), STACKS_NUM, FREECELLS_NUM #ifndef FCS_FREECELL_ONLY , FCS_SEQ_BUILT_BY_ALTERNATE_COLOR #endif ); fcs_init_and_encode_state( delta, local_variant, &(init_state), &enc_state ); fc_solve_meta_compact_allocator_init (&meta_alloc); fc_solve_compact_allocator_init( &allocator, &meta_alloc); instance_solver_thread_calc_derived_states( local_variant, &init_state, NULL, &derived_list, &derived_list_recycle_bin, &allocator, perform_horne_prune ); iter = derived_list; while (iter) { states_count++; iter = iter->next; } *(num_out_derived_states) = states_count; debug_ret = SMALLOC(debug_ret, states_count); *(out_derived_states) = debug_ret; fc_solve_init_locs(&locs); iter = derived_list; while (iter) { debug_ret[idx].state_string = fc_solve_state_as_string( &(iter->state.s), &locs, FREECELLS_NUM, STACKS_NUM, DECKS_NUM, 1, 0, 1 ); debug_ret[idx].move = iter->move; debug_ret[idx].core_irreversible_moves_count = iter->core_irreversible_moves_count; debug_ret[idx].num_non_reversible_moves_including_prune = iter->num_non_reversible_moves_including_prune; /* TODO : Put something meaningful there by passing it to the function. */ debug_ret[idx].which_irreversible_moves_bitmask = iter->which_irreversible_moves_bitmask; idx++; iter = iter->next; } assert(idx == states_count); fc_solve_compact_allocator_finish(&allocator); fc_solve_meta_compact_allocator_finish( &meta_alloc ); fc_solve_delta_stater_free (delta); return 0; }
/* * The char * returned is malloc()ed and should be free()ed. */ DLLEXPORT int fc_solve_user_INTERNAL_find_fcc_start_points( enum fcs_dbm_variant_type_t local_variant, const char * init_state_str_proto, const int start_state_moves_count, const fcs_fcc_move_t * const start_state_moves, fcs_FCC_start_point_result_t * * out_fcc_start_points, long * out_num_new_positions ) { fcs_state_keyval_pair_t init_state; fc_solve_delta_stater_t * delta; fcs_encoded_state_buffer_t enc_state; fcs_state_locs_struct_t locs; int i; fcs_meta_compact_allocator_t meta_alloc; fcs_FCC_start_points_list_t start_points_list; dict_t * do_next_fcc_start_points_exist; dict_t * does_min_by_sorting_exist; fcs_lru_cache_t does_state_exist_in_any_FCC_cache; const int max_num_elements_in_cache = 1000; fcs_bool_t is_min_by_sorting_new; fcs_encoded_state_buffer_t min_by_sorting; fcs_fcc_moves_seq_allocator_t moves_list_allocator; fcs_fcc_moves_seq_t start_state_moves_seq; int states_count = 0; fcs_FCC_start_point_t * iter; fcs_FCC_start_point_result_t * ret; add_start_point_context_t add_start_point_context; void * tree_recycle_bin = NULL; fcs_compact_allocator_t moves_list_compact_alloc; DECLARE_IND_BUF_T(indirect_stacks_buffer) fc_solve_initial_user_state_to_c( init_state_str_proto, &init_state, FREECELLS_NUM, STACKS_NUM, DECKS_NUM, indirect_stacks_buffer ); delta = fc_solve_delta_stater_alloc( &(init_state.s), STACKS_NUM, FREECELLS_NUM #ifndef FCS_FREECELL_ONLY , FCS_SEQ_BUILT_BY_ALTERNATE_COLOR #endif ); fcs_init_and_encode_state( delta, local_variant, &(init_state), &enc_state ); start_points_list.list = NULL; start_points_list.recycle_bin = NULL; fc_solve_meta_compact_allocator_init( &meta_alloc ); fc_solve_compact_allocator_init(&(start_points_list.allocator), &meta_alloc); do_next_fcc_start_points_exist = fc_solve_kaz_tree_create(fc_solve_compare_encoded_states, NULL, &meta_alloc, &tree_recycle_bin); does_min_by_sorting_exist = fc_solve_kaz_tree_create(fc_solve_compare_encoded_states, NULL, &meta_alloc, &tree_recycle_bin); cache_init(&does_state_exist_in_any_FCC_cache, max_num_elements_in_cache, &meta_alloc); fc_solve_compact_allocator_init(&(moves_list_compact_alloc), &(meta_alloc)); moves_list_allocator.recycle_bin = NULL; moves_list_allocator.allocator = &(moves_list_compact_alloc); start_state_moves_seq.count = start_state_moves_count; start_state_moves_seq.moves_list = NULL; { fcs_fcc_moves_list_item_t * * moves_iter = &(start_state_moves_seq.moves_list); for ( i=0 ; i < start_state_moves_count ; ) { if (i % FCS_FCC_NUM_MOVES_IN_ITEM == 0) { *(moves_iter) = fc_solve_fcc_alloc_moves_list_item(&moves_list_allocator); } (*moves_iter)->data.s[i % FCS_FCC_NUM_MOVES_IN_ITEM] = start_state_moves[i]; if ((++i) % FCS_FCC_NUM_MOVES_IN_ITEM == 0) { moves_iter = &((*moves_iter)->next); } } } add_start_point_context.do_next_fcc_start_points_exist = do_next_fcc_start_points_exist; add_start_point_context.next_start_points_list = &start_points_list; add_start_point_context.moves_list_allocator = &moves_list_allocator; perform_FCC_brfs( local_variant, &(init_state), enc_state, &start_state_moves_seq, fc_solve_add_start_point_in_mem, &add_start_point_context, &is_min_by_sorting_new, &min_by_sorting, does_min_by_sorting_exist, &does_state_exist_in_any_FCC_cache, out_num_new_positions, &moves_list_allocator, &meta_alloc ); iter = start_points_list.list; while (iter) { states_count++; iter = iter->next; } *out_fcc_start_points = ret = SMALLOC(ret, states_count+1); ret[states_count].count = 0; fc_solve_init_locs(&locs); iter = start_points_list.list; for (i = 0; i < states_count ; i++) { fcs_state_keyval_pair_t state; DECLARE_IND_BUF_T(state_indirect_stacks_buffer) ret[i].count = iter->moves_seq.count; ret[i].moves = SMALLOC(ret[i].moves, ret[i].count); { int moves_idx; fcs_fcc_moves_list_item_t * moves_iter = iter->moves_seq.moves_list; for (moves_idx = 0 ; moves_idx < ret[i].count ; ) { ret[i].moves[moves_idx] = moves_iter->data.s[moves_idx % FCS_FCC_NUM_MOVES_IN_ITEM]; if ((++moves_idx) % FCS_FCC_NUM_MOVES_IN_ITEM == 0) { moves_iter = moves_iter->next; } } } fc_solve_delta_stater_decode_into_state(delta, iter->enc_state.s, &(state), state_indirect_stacks_buffer); ret[i].state_as_string = fc_solve_state_as_string( &(state.s), &locs, FREECELLS_NUM, STACKS_NUM, DECKS_NUM, 1, 0, 1 ); iter = iter->next; } fc_solve_compact_allocator_finish(&(start_points_list.allocator)); fc_solve_compact_allocator_finish(&(moves_list_compact_alloc)); fc_solve_delta_stater_free (delta); fc_solve_kaz_tree_destroy(do_next_fcc_start_points_exist); fc_solve_kaz_tree_destroy(does_min_by_sorting_exist); cache_destroy(&does_state_exist_in_any_FCC_cache); fc_solve_meta_compact_allocator_finish( &meta_alloc ); return 0; }