[Contents] [Back] [Prev] [Up] [Next] [Forward]
Jump to:
a
-
b
-
c
-
d
-
f
-
h
-
i
-
p
-
s
-
t
-
v
attack()
attack2()
attack3()
attack4()
break_chain()
break_chain2()
chainlinks()
defend1()
defend2(int m, int n, int *i, int *j)
defend3(int m, int n, int *i, int *j)
dump_stack(void)
find_cap2()
find_defense() :
hashtable_enter_position(), hashtable_enter_position()
hashtable_search()
int confirm_safety(int i, int j, int color, int value)
int connection_value(int ai, int aj, int bi, int bj, int ti, int tj)
int count(int i, int j, int color, char mx[MAX_BOARD][MAX_BOARD], int maxlib, char mark)
int cut_possible(int i, int j, int color)
int does_attack(int ti, int tj, int ai, int aj)
int does_defend(int ti, int tj, int ai, int aj)
int find_lunch(int m, int n, int *wi, int *wj, int *ai, int *aj)
int is_ko(int i, int j, int color)
int legal(int i, int j, int color)
int popgo()
int singleton(int i, int j)
int TRY_MOVE()
int trymove(int i, int j, int color, const char *message, int k, int l)
pushgo()
safe_move()
small_semeai()
snapback()
tryko(int i, int j, int color, const char *message)
vgprintf(FILE* outputfile, const char *fmt, va_list ap)
void change_attack(int ai, int aj, int ti, int tj)
void change_defense(int ai, int aj, int ti, int tj)
void change_dragon_status(int x, int y, int status)
void TRACE(const char *fmt, ...)
[Contents] [Back] [Prev] [Up] [Next] [Forward]