Searched refs:square (Results 1 - 25 of 112) sorted by relevance

12345

/macosx-10.10/Chess-310.6/Sources/
H A DMBCBoardViewAccessibility.h54 + (id) proxyWithView:(MBCBoardView *)view square:(MBCSquare)square;
55 - (id) initWithView:(MBCBoardView *)view square:(MBCSquare)square;
61 - (NSString *) describeSquare:(MBCSquare)square;
62 - (void) selectSquare:(MBCSquare)square;
H A DMBCBoardViewAccessibility.mm51 + (id) proxyWithView:(MBCBoardView *)view square:(MBCSquare)square
54 initWithView:view square:square]
58 - (id) initWithView:(MBCBoardView *)view square:(MBCSquare)square
61 fSquare = square;
206 for (MBCSquare square = 0; square<64; ++square)
[all...]
H A DMBCBoardViewMouse.h50 - (NSRect) approximateBoundsOfSquare:(MBCSquare)square;
H A DMBCInteractivePlayer.h85 - (void) startSelection:(MBCSquare)square;
86 - (void) endSelection:(MBCSquare)square animate:(BOOL)animate;
/macosx-10.10/Chess-310.6/sjeng/
H A Dattacks.c27 int calc_attackers (int square, int color) { argument
29 /* this function calculates attack information for a square */
38 if (board[square] == frame) return 0;
44 a_sq = square + rook_o[i];
46 /* the king can attack from one square away: */
69 a_sq = square + bishop_o[i];
76 /* the king can attack from one square away: */
98 a_sq = square + knight_o[i];
112 a_sq = square + rook_o[i];
113 /* the king can attack from one square awa
346 is_attacked(int square, int color) argument
448 nk_attacked(int square, int color) argument
[all...]
H A Dsjeng.h93 #define rank(square) ((((square)-26)/12)+1)
94 #define file(square) ((((square)-26)%12)+1)
96 #define rank(square) (rank[(square)])
97 #define file(square) (file[(square)])
99 #define diagl(square) (diagl[(square)])
[all...]
H A Dseval.c46 static int s_bishop_mobility(int square) argument
51 for (l = square-13; board[l] == npiece; l-=13)
53 for (l = square-11; board[l] == npiece; l-=11)
55 for (l = square+11; board[l] == npiece; l+=11)
57 for (l = square+13; board[l] == npiece; l+=13)
63 static int s_rook_mobility(int square) argument
68 for (l = square-12; board[l] == npiece; l-=12)
70 for (l = square-1; board[l] == npiece; l-=1)
72 for (l = square+1; board[l] == npiece; l+=1)
74 for (l = square
80 s_knight_mobility(int square) argument
93 s_pawn_mobility(int square) argument
109 s_king_mobility(int square) argument
122 black_saccers(int square) argument
203 white_saccers(int square) argument
[all...]
H A Dsee.c30 int square; member in struct:__anon397
36 void setup_attackers (int square) { argument
38 /* this function calculates attack information for a square */
49 a_sq = square + rook_o[i];
52 /* the king can attack from one square away: */
56 see_attackers[WHITE][numw].square = a_sq;
63 see_attackers[BLACK][numb].square = a_sq;
75 see_attackers[WHITE][numw].square = a_sq;
82 see_attackers[BLACK][numb].square = a_sq;
96 a_sq = square
201 see(int color, int square, int from) argument
[all...]
H A Dleval.c42 static int l_bishop_mobility(int square) argument
47 for (l = square-13; board[l] == npiece; l-=13)
49 for (l = square-11; board[l] == npiece; l-=11)
51 for (l = square+11; board[l] == npiece; l+=11)
53 for (l = square+13; board[l] == npiece; l+=13)
59 static int l_rook_mobility(int square) argument
64 for (l = square-12; board[l] == npiece; l-=12)
66 for (l = square-1; board[l] == npiece; l-=1)
68 for (l = square+1; board[l] == npiece; l+=1)
70 for (l = square
77 l_knight_mobility(int square) argument
90 l_pawn_mobility(int square) argument
106 l_king_mobility(int square) argument
[all...]
H A Dprotos.h45 bool is_attacked (int square, int color);
46 bool nk_attacked (int square, int color);
127 int calc_attackers(int square, int color);
168 int see(int color, int square, int from);
/macosx-10.10/tcl-105/tcl_ext/snack/snack/ext/
H A Dtest.tcl17 # Apply the command defined in the square package
19 s square
/macosx-10.10/tcl-105/tk/tk/generic/ttk/
H A DttkSquare.c0 /* square.c - Copyright (C) 2004 Pat Thoyts <patthoyts@users.sourceforge.net>
40 SquarePart square; member in struct:__anon13573
58 DEFAULT_BORDERWIDTH, Tk_Offset(Square,square.borderWidthObj), -1,
61 DEFAULT_BACKGROUND, Tk_Offset(Square,square.foregroundObj),
65 "50", Tk_Offset(Square,square.widthObj), -1, 0, 0,
68 "50", Tk_Offset(Square,square.heightObj), -1, 0, 0,
72 Tk_Offset(Square,square.paddingObj), -1,
76 NULL, Tk_Offset(Square,square.reliefObj), -1, TK_OPTION_NULL_OK, 0, 0},
79 NULL, Tk_Offset(Square,square.anchorObj), -1, TK_OPTION_NULL_OK, 0, 0},
87 * is the -anchor option which positions the square elemen
207 SquareElement *square = elementRecord; local
224 SquareElement *square = elementRecord; local
[all...]
/macosx-10.10/emacs-93/emacs/lisp/play/
H A Dgomoku.el33 ;; player, in turn, marks a free square of its choice. The winner is the first
57 ;; on the square where you want to play and hit RET, or X, or whatever key you
95 (defconst gomoku-square-width 4
98 (defconst gomoku-square-height 2
190 You and Emacs play in turn by marking a free square. You mark it with X
194 You play by moving the cursor over the square you choose and hitting \\[gomoku-human-plays].
219 ;; detect when we are trying to move out of the board. We denote a square by
221 ;; leftmost topmost square has coords (1,1) and index gomoku-board-width + 2.
257 ;; Every square is 0 (i.e. empty) except padding squares:
274 ;; Every (free) square ha
[all...]
H A Dlandmark.el78 ;; detect when we are trying to move out of the board. We denote a square by
80 ;; leftmost topmost square has coords (1,1) and index lm-board-width + 2.
127 ;; Every square is 0 (i.e. empty) except padding squares:
144 (defconst lm-square-width 2
147 (defconst lm-square-height 1
243 You and Emacs play in turn by marking a free square. You mark it with X
247 You play by moving the cursor over the square you choose and hitting \\[lm-human-plays].
268 ;; Every (free) square has a score associated to it, recorded in the
269 ;; LM-SCORE-TABLE vector. The program always plays in the square having
292 ;; Given the score of every qtuple, the score of a given free square o
1357 (defun square (a) function
[all...]
/macosx-10.10/ruby-106/ruby/ext/tk/sample/demos-en/
H A Dknightstour.rb8 # This uses Warnsdorff's rule to calculate the next square each
9 # time. This specifies that the next square should be the one that
14 # this occurs when the starting square is d6.
23 # You can drag the knight to a specific square to start if you wish.
30 # Return a list of accessible squares from a given square
31 def valid_moves(square)
36 col = (square % 8) + col_delta
37 row = (square.div(8)) + row_delta
43 # Return the number of available moves for this square
44 def check_square(square)
[all...]
/macosx-10.10/ruby-106/ruby/ext/tk/sample/demos-jp/
H A Dknightstour.rb10 # This uses Warnsdorff's rule to calculate the next square each
11 # time. This specifies that the next square should be the one that
16 # this occurs when the starting square is d6.
25 # You can drag the knight to a specific square to start if you wish.
32 # Return a list of accessible squares from a given square
33 def valid_moves(square)
38 col = (square % 8) + col_delta
39 row = (square.div(8)) + row_delta
45 # Return the number of available moves for this square
46 def check_square(square)
[all...]
/macosx-10.10/WebCore-7600.1.25/platform/graphics/cairo/
H A DDrawErrorUnderline.h38 // \ \/ C \/ / \ \/ C \ | height = heightSquares * square
45 // unitWidth = (heightSquares - 1) * square
55 double square = height / heightSquares; local
56 double halfSquare = 0.5 * square;
58 double unitWidth = (heightSquares - 1.0) * square;
80 cairo_line_to(cr, right, top + square); // C
/macosx-10.10/tcl-105/tk/tk/library/demos/
H A Dknightstour.tcl5 # This uses Warnsdorff's rule to calculate the next square each
6 # time. This specifies that the next square should be the one that
11 # this occurs when the starting square is d6.
20 # You can drag the knight to a specific square to start if you wish.
26 # Return a list of accessible squares from a given square
27 proc ValidMoves {square} {
30 set col [expr {($square % 8) + [lindex $pair 0]}]
31 set row [expr {($square / 8) + [lindex $pair 1]}]
39 # Return the number of available moves for this square
40 proc CheckSquare {square} {
[all...]
/macosx-10.10/tcl-105/tcl_ext/tclsoap/tclsoap/samples/
H A Dxmlrpc-methods-client.tcl19 lappend methods [ XMLRPC::create tclsoapTest1.square \
20 -proxy http://localhost:8015/rpc/square \
H A Dcgi-clients.tcl33 SOAP::create square -uri $uri -action $action -proxy $proxy \
42 XMLRPC::create tclsoap.square -proxy $proxy -params {num double}
H A Dsoap-methods-client.tcl44 set name square
45 lappend methods [ SOAP::create $name -name square -uri $uri \
H A Dxmlrpc-methods-server.tcl53 # square - test validation of numerical methods.
55 proc /square {num} {
/macosx-10.10/tcl-105/tcl_ext/tclsoap/tclsoap/cgi-bin/soap/
H A Dtclsoap-Test.tcl21 SOAP::export time square sum platform printenv printenv_names mistake
35 # the square of the value.
36 proc square {num} { procedure
96 foreach name {time square sum platform printenv printenv_names mistake} {
/macosx-10.10/ruby-106/ruby/ext/tk/sample/tcltklib/
H A Dsample2.rb265 each_square do |square|
266 if square.oval != nil
267 self.e("delete", square.oval)
268 square.oval = nil
307 each_square do |square|
308 draw_disk(square.row, square.col,
309 @board.get_disk(square.row, square.col))
317 rows.each do |square|
[all...]
/macosx-10.10/tcl-105/tcl84/tcl/tools/
H A DcvtEOL.tcl22 square widget rmt ixset hello browse rolodex tcolor timer}

Completed in 235 milliseconds

12345