Source

black-hole-solitaire / black-hole-solitaire / c-solver / rank_reach_prune.c

/* Copyright (c) 2010 Shlomi Fish
 *
 * Permission is hereby granted, free of charge, to any person
 * obtaining a copy of this software and associated documentation
 * files (the "Software"), to deal in the Software without
 * restriction, including without limitation the rights to use,
 * copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following
 * conditions:
 *
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
 * OTHER DEALINGS IN THE SOFTWARE.
 */
/*
 * rank_reach_prune.c - find rank-based reachability.
 *
 * See:
 *
 * http://tech.groups.yahoo.com/group/fc-solve-discuss/message/1228
 *
 */

#include "config.h"
#include "rank_reach_prune.h"

#define NUM_RANKS 13

static const int LINKS[2] = {-1,1};

DLLEXPORT enum RANK_REACH_VERDICT bhs_find_rank_reachability(
    signed char foundation,
    const unsigned char * rank_counts
)
{
    return bhs_find_rank_reachability__inline(foundation, rank_counts);
}