Home
last modified time | relevance | path

Searched refs:pawns (Results 1 – 25 of 413) sorted by relevance

12345678910>>...17

/dports/games/sjeng/Sjeng-Free-11.2/
H A Dneval.c197 memset (pawns, 0, sizeof (pawns)); in end_eval()
215 pawns[1][pawn_file]++; in end_eval()
221 pawns[0][pawn_file]++; in end_eval()
258 if (!pawns[1][pawn_file+1] && !pawns[1][pawn_file-1]) { in end_eval()
370 if (!pawns[0][pawn_file+1] && !pawns[0][pawn_file-1]) { in end_eval()
836 memset (pawns, 0, sizeof (pawns)); in mid_eval()
897 if (!pawns[1][pawn_file+1] && !pawns[1][pawn_file-1]) { in mid_eval()
975 if (!pawns[0][pawn_file+1] && !pawns[0][pawn_file-1]) { in mid_eval()
1402 memset (pawns, 0, sizeof (pawns)); in opn_eval()
1468 if (!pawns[1][pawn_file+1] && !pawns[1][pawn_file-1]) { in opn_eval()
[all …]
H A Dleval.c146 memset (pawns, 0, sizeof (pawns)); in losers_eval()
164 pawns[1][pawn_file]++; in losers_eval()
170 pawns[0][pawn_file]++; in losers_eval()
203 if (!pawns[1][pawn_file+1] && !pawns[1][pawn_file-1]) { in losers_eval()
211 if (!pawns[0][pawn_file]) { in losers_eval()
218 if (pawns[1][pawn_file] > 1) in losers_eval()
243 if (!pawns[1][pawn_file-1]) in losers_eval()
267 if (!pawns[0][pawn_file+1] && !pawns[0][pawn_file-1]) { in losers_eval()
275 if (!pawns[1][pawn_file]) { in losers_eval()
282 if (pawns[0][pawn_file] > 1) in losers_eval()
[all …]
H A Dseval.c320 memset (pawns, 0, sizeof (pawns)); in suicide_mid_eval()
338 pawns[1][pawn_file]++; in suicide_mid_eval()
344 pawns[0][pawn_file]++; in suicide_mid_eval()
378 if (!pawns[1][pawn_file+1] && !pawns[1][pawn_file-1]) { in suicide_mid_eval()
386 if (!pawns[0][pawn_file]) { in suicide_mid_eval()
393 if (pawns[1][pawn_file] > 1) in suicide_mid_eval()
414 if (!pawns[1][pawn_file-1]) in suicide_mid_eval()
437 if (!pawns[0][pawn_file+1] && !pawns[0][pawn_file-1]) { in suicide_mid_eval()
445 if (!pawns[1][pawn_file]) { in suicide_mid_eval()
452 if (pawns[0][pawn_file] > 1) in suicide_mid_eval()
[all …]
/dports/games/py-pychess/pychess-1.0.2/lib/pychess/Utils/lutils/
H A Dleval.py134 pawns = pieceCount[leading][PAWN]
136 val = min(2400, matDiff) + (matDiff * (12000 - matTotal) * pawns) // (6400 * (pawns + 1))
250 for cord in iterBits(pawns):
362 pawns = boards[PAWN]
369 passed &= pawns
370 weaked &= pawns
503 s = bin(wall1 & pawns).count("1") * 2 + bin(wall2 & pawns).count("1")
528 pawns = boards[PAWN]
541 qpawns = max(qwingpawns1[color] & pawns, qwingpawns2[color] & pawns)
542 kpawns = max(kwingpawns1[color] & pawns, kwingpawns2[color] & pawns)
[all …]
H A Dlmovegen.py196 pawns = board.boards[board.color][PAWN]
206 for cord in iterBits(pawns):
239 pawns = board.boards[board.color][PAWN]
324 movedpawns = (pawns >>
355 capLeftPawns = pawns & ~fileBits[0]
408 capLeftPawns = pawns & ~fileBits[7]
478 pawns = board.boards[board.color][PAWN]
556 capLeftPawns = pawns & ~fileBits[0]
588 capLeftPawns = pawns & ~fileBits[7]
624 pawns = board.boards[color][PAWN]
[all …]
H A Dstrateval.py107 pawns = board.boards[color][PAWN]
113 if ffile & pawns and not tfile & pawns and bin(pawns).count("1") >= 3:
406 pawns = board.boards[color][PAWN]
412 for cord in iterBits(pawns):
418 if frontCords & pawns:
448 count = bin(pawns & bits).count("1")
466 wpawns = pawns
471 bpawns = pawns
518 if stonewall[color] & pawns == stonewall[color] and \
/dports/games/biloba/biloba-0.9.3/src/
H A Dcomputer.c54 LList *pawns; in computer_defend() local
63 pawns = llist_copy(allowed); in computer_defend()
125 llist_free(pawns); in computer_defend()
190 LList *pawns, *cur; in prepare_move() local
197 pawns = llist_copy(allowed); in prepare_move()
201 pawn_count = llist_length(pawns); in prepare_move()
204 Pawn *pawn = (Pawn *)pawns->data; in prepare_move()
213 llist_free(pawns); in prepare_move()
217 llist_free(pawns); in prepare_move()
343 cur = pawns; in prepare_move()
[all …]
H A Dlogic.c170 LList *cur = pawns; in ask_replacements()
174 if (pawns) { in ask_replacements()
179 start = player_select_tile(player, pawns); in ask_replacements()
181 !llist_find(pawns, start->pawn)) in ask_replacements()
229 cur = pawns; in ask_replacements()
253 cur = pawns; in ask_replacements()
256 llist_free(pawns); in ask_replacements()
306 llist_for_each(pawns, pawn_eat); in play_game()
307 llist_free(pawns); in play_game()
435 for (cur = pawns; cur; cur = cur->next) { in end_game()
[all …]
H A Dplayer.c84 LList *pawns = pawn_get_all(player->color); in player_can_eat_soon() local
88 for (cur = pawns; cur; cur = cur->next) { in player_can_eat_soon()
168 llist_free(pawns); in player_can_eat_soon()
175 LList *pawns = pawn_get_all(player->color); in player_can_be_eaten() local
179 for (cur = pawns; cur; cur = cur->next) { in player_can_be_eaten()
256 llist_free(pawns); in player_can_be_eaten()
265 LList *pawns = pawn_get_all((PawnColor)i); in player_kill() local
266 for (; pawns; pawns = pawns->next) { in player_kill()
267 Pawn *pawn = (Pawn *)pawns->data; in player_kill()
H A Dboard.c120 LList *pawns = pawn_get_all(player->color); in board_set_player() local
130 if (!pawns) in board_set_player()
135 pawn = pawns->data; in board_set_player()
150 llist_free(pawns); in board_set_player()
H A Darrow.c130 LList *pawns = pawn_get_replacement_pending_pawns(player->color); in arrow_draw_all() local
131 LList *cur = pawns; in arrow_draw_all()
143 llist_free(pawns); in arrow_draw_all()
H A Dpawn.c217 LList *pawns = my_pawns; in pawn_free_all() local
218 for(; pawns; pawns = pawns->next) { in pawn_free_all()
219 Pawn *pawn = (Pawn *)pawns->data; in pawn_free_all()
/dports/lang/racket/racket-8.3/share/pkgs/games/parcheesi/
H A Dboard.rkt62 (f (vector-ref all-pawns (- i 1)) (vector-ref v (- i 1)))
87 ;; can ignore start pawns
89 ;; main pawns
97 ;; home row pawns
113 ;; home pawns
121 ; (matching-pawns <board-exp> <pawn-id> <loc-id> <test-exp>)
122 (define-syntax (matching-pawns stx)
148 (matching-pawns board
323 (define all-pawns
343 (unless (= i (pawn-index (vector-ref all-pawns i)))
[all …]
H A Dmake-bitmap.rkt295 [num (length pawns)])
304 (do (list-ref pawns 3) 0 0)
305 (do (list-ref pawns 2) -1 0)
306 (do (list-ref pawns 1) 0 -1)
307 (do (list-ref pawns 0) -1 -1)]
309 (do (list-ref pawns 2) 0 -1/2)
310 (do (list-ref pawns 1) -1 0)
311 (do (list-ref pawns 0) -1 -1)]
313 (do (list-ref pawns 2) -1/2 0)
314 (do (list-ref pawns 1) 0 -1)
[all …]
H A Dgui.rkt308 [num (length pawns)])
317 (do (list-ref pawns 3) 0 0)
318 (do (list-ref pawns 2) -1 0)
319 (do (list-ref pawns 1) 0 -1)
320 (do (list-ref pawns 0) -1 -1)]
322 (do (list-ref pawns 2) 0 -1/2)
323 (do (list-ref pawns 1) -1 0)
324 (do (list-ref pawns 0) -1 -1)]
326 (do (list-ref pawns 2) -1/2 0)
327 (do (list-ref pawns 1) 0 -1)
[all …]
H A Drules.rkt34 (p "Parcheesi is a race between four players. Each player moves four pawns "
36 "The first player to get all four pawns into the center wins. ")
38 (p "Initially, the board looks like this, with each player's pawns "
42 (p "On each turn, a player rolls two dice and moves their pawns according to these rules: "
91 "Two pawns of the same color on a space form a blockade. "
127 "starting square. The player that bopped now may move any one of its pawns by 20. "
146 "occupied by two different colored pawns. One pawn on a safety does not constitute a "
215 … "Each square in the main ring and in the home rows can only have zero, one or two pawns on it. "
216 …"If it contains two pawns, those pawns must be the same color (and would form a blockade, as above…
/dports/games/crafty/crafty-25.2_1/
H A Dtbprobe.c94 uint64_t pawns; member
576 return pos->pawns & pos->white; in get_pieces()
588 return pos->pawns & pos->black; in get_pieces()
1124 if ((pos->kings & pos->pawns) != 0) in is_valid()
1132 if ((pos->queens & pos->pawns) != 0) in is_valid()
1138 if ((pos->rooks & pos->pawns) != 0) in is_valid()
1142 if ((pos->bishops & pos->pawns) != 0) in is_valid()
1169 pos->pawns = do_bb_move(pos0->pawns, from, to); in do_move()
1201 pos->pawns &= ep_mask; in do_move()
1615 pawns, in tb_probe_wdl_impl()
[all …]
H A Dtbcore.c973 t = ptr->pawns[0] - 1; in encode_pawn()
980 i = ptr->pawns[0]; in encode_pawn()
981 t = i + ptr->pawns[1]; in encode_pawn()
1129 norm[0] = ptr->pawns[0]; in set_norm_pawn()
1130 if (ptr->pawns[1]) in set_norm_pawn()
1131 norm[ptr->pawns[0]] = ptr->pawns[1]; in set_norm_pawn()
1133 for (i = ptr->pawns[0] + ptr->pawns[1]; i < ptr->num; i += norm[i]) in set_norm_pawn()
1179 j = 1 + (ptr->pawns[1] > 0); in setup_pieces_pawn()
1204 j = 1 + (ptr->pawns[1] > 0); in setup_pieces_pawn_dtz()
1631 entry->pawns[0] = ((struct TBEntry_pawn *) ptr)->pawns[0]; in load_dtz_table()
[all …]
H A Devaluate.c919 int pawns, rank, mg_base, eg_base, bonus, enemy = Flip(side); in EvaluatePassedPawns() local
933 for (pawns = tree->pawn_score.passed[side]; pawns; pawns &= pawns - 1) { in EvaluatePassedPawns()
934 file = LSB8Bit(pawns); in EvaluatePassedPawns()
1082 uint64_t pawns, thispawn; in EvaluatePassedPawnRaces() local
1098 for (pawns = Pawns(side); pawns; pawns &= pawns - 1) { in EvaluatePassedPawnRaces()
1099 pawnsq = LSB(pawns); in EvaluatePassedPawnRaces()
1246 uint64_t pawns, attackers, defenders; in EvaluatePawns() local
1259 for (pawns = Pawns(side); pawns; pawns &= pawns - 1) { in EvaluatePawns()
1260 square = LSB(pawns); in EvaluatePawns()
/dports/games/scid/scid/scripts/
H A Dtbstats.tcl36 proc section {w b {type pawns}} { argument
184 proc tb33 {{type pawns}} { argument
212 proc tb42 {{type pawns}} { argument
236 proc tb51 {{type pawns}} { argument
264 proc tb43 {{type pawns}} { argument
294 proc tb52 {{type pawns}} { argument
320 proc tb61 {{type pawns}} { argument
/dports/games/gnushogi/gnushogi-1.4.2/misc/
H A Dgnushogi.pat17 # without pawns
53 # without pawns
92 # Incomplete Mino without pawns
94 # Complete Mino without pawns
96 # High Mino without pawns
98 # Silver Crown without pawns
100 # Bear-in-the-Hole without pawns
106 # without pawns
/dports/games/scid/scid/engines/phalanx-scid/
H A DHISTORY12 evaluation function, it now knows more about passed pawns, the
28 pieces static evaluation. Better evaluation of weak pawns. Trapped
87 knowledge, mostly for endgames with minor pieces and pawns: knight
90 wins against a knight), onepawn() as a special case of pawns(), bad
93 moving castling-side pawns in middlegame.
110 bonus - if there are no pawns, you often need a rook more to win the
117 endgame.c: trade bonus did not work for kings and pawns endgames.
195 kings+pawns endgames - penalty for pawns on one file (doubled) worked
196 as penalty for pawns on one row. Improved kings+pawns endgames
231 evaluation of kings+pawns endgames - the evaluation of 'king in the
[all …]
/dports/devel/godot-tools/godot-demo-projects-8d9d58f112d8/2d/role_playing_game/screens/exploration/
H A DExploration.tscn6 [ext_resource path="res://grid_movement/pawns/Character.tscn" type="PackedScene" id=4]
8 [ext_resource path="res://grid_movement/pawns/Character.gd" type="Script" id=6]
11 [ext_resource path="res://grid_movement/pawns/Pawn.gd" type="Script" id=9]
/dports/games/phalanx/Phalanx-XXV/
H A DHISTORY12 evaluation function, it now knows more about passed pawns, the
28 pieces static evaluation. Better evaluation of weak pawns. Trapped
87 knowledge, mostly for endgames with minor pieces and pawns: knight
90 wins against a knight), onepawn() as a special case of pawns(), bad
93 moving castling-side pawns in middlegame.
110 bonus - if there are no pawns, you often need a rook more to win the
117 endgame.c: trade bonus did not work for kings and pawns endgames.
195 kings+pawns endgames - penalty for pawns on one file (doubled) worked
196 as penalty for pawns on one row. Improved kings+pawns endgames
231 evaluation of kings+pawns endgames - the evaluation of 'king in the
[all …]
/dports/games/stockfish/Stockfish-sf_14/src/
H A Dpawns.cpp288 Bitboard pawns = pos.pieces(Us, PAWN); in do_king_safety() local
291 if (pawns & attacks_bb<KING>(ksq)) in do_king_safety()
293 else while (pawns) in do_king_safety()
294 minPawnDist = std::min(minPawnDist, distance(ksq, pop_lsb(pawns))); in do_king_safety()

12345678910>>...17