Subversion Repositories Games.Chess Giants

Rev

Rev 154 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 154 Rev 169
Line 4... Line 4...
4
  Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
4
  Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
5
  Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
5
  Copyright (C) 2015-2018 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
6
 
6
 
7
  Stockfish is free software: you can redistribute it and/or modify
7
  Stockfish is free software: you can redistribute it and/or modify
8
  it under the terms of the GNU General Public License as published by
8
  it under the terms of the GNU General Public License as published by
9
  the Free Software Foundation, either version 3 of the License, or
9
  the Free Software Foundation, either version 3 of the License, or
10
  (at your option) any later version.
10
  (at your option) any later version.
Line 35... Line 35...
35
 
35
 
36
  Score pawns_score() const { return score; }
36
  Score pawns_score() const { return score; }
37
  Bitboard pawn_attacks(Color c) const { return pawnAttacks[c]; }
37
  Bitboard pawn_attacks(Color c) const { return pawnAttacks[c]; }
38
  Bitboard passed_pawns(Color c) const { return passedPawns[c]; }
38
  Bitboard passed_pawns(Color c) const { return passedPawns[c]; }
39
  Bitboard pawn_attacks_span(Color c) const { return pawnAttacksSpan[c]; }
39
  Bitboard pawn_attacks_span(Color c) const { return pawnAttacksSpan[c]; }
-
 
40
  int weak_unopposed(Color c) const { return weakUnopposed[c]; }
40
  int pawn_asymmetry() const { return asymmetry; }
41
  int pawn_asymmetry() const { return asymmetry; }
41
  int open_files() const { return openFiles; }
42
  int open_files() const { return openFiles; }
42
 
43
 
43
  int semiopen_file(Color c, File f) const {
44
  int semiopen_file(Color c, File f) const {
44
    return semiopenFiles[c] & (1 << f);
45
    return semiopenFiles[c] & (1 << f);
Line 47... Line 48...
47
  int semiopen_side(Color c, File f, bool leftSide) const {
48
  int semiopen_side(Color c, File f, bool leftSide) const {
48
    return semiopenFiles[c] & (leftSide ? (1 << f) - 1 : ~((1 << (f + 1)) - 1));
49
    return semiopenFiles[c] & (leftSide ? (1 << f) - 1 : ~((1 << (f + 1)) - 1));
49
  }
50
  }
50
 
51
 
51
  int pawns_on_same_color_squares(Color c, Square s) const {
52
  int pawns_on_same_color_squares(Color c, Square s) const {
52
    return pawnsOnSquares[c][!!(DarkSquares & s)];
53
    return pawnsOnSquares[c][bool(DarkSquares & s)];
53
  }
54
  }
54
 
55
 
55
  template<Color Us>
56
  template<Color Us>
56
  Score king_safety(const Position& pos, Square ksq) {
57
  Score king_safety(const Position& pos, Square ksq) {
57
    return  kingSquares[Us] == ksq && castlingRights[Us] == pos.can_castle(Us)
58
    return  kingSquares[Us] == ksq && castlingRights[Us] == pos.can_castle(Us)
Line 69... Line 70...
69
  Bitboard passedPawns[COLOR_NB];
70
  Bitboard passedPawns[COLOR_NB];
70
  Bitboard pawnAttacks[COLOR_NB];
71
  Bitboard pawnAttacks[COLOR_NB];
71
  Bitboard pawnAttacksSpan[COLOR_NB];
72
  Bitboard pawnAttacksSpan[COLOR_NB];
72
  Square kingSquares[COLOR_NB];
73
  Square kingSquares[COLOR_NB];
73
  Score kingSafety[COLOR_NB];
74
  Score kingSafety[COLOR_NB];
-
 
75
  int weakUnopposed[COLOR_NB];
74
  int castlingRights[COLOR_NB];
76
  int castlingRights[COLOR_NB];
75
  int semiopenFiles[COLOR_NB];
77
  int semiopenFiles[COLOR_NB];
76
  int pawnsOnSquares[COLOR_NB][COLOR_NB]; // [color][light/dark squares]
78
  int pawnsOnSquares[COLOR_NB][COLOR_NB]; // [color][light/dark squares]
77
  int asymmetry;
79
  int asymmetry;
78
  int openFiles;
80
  int openFiles;