chess 0.0.9 → 0.1.0

data/doc/js/searcher.js

@@ -0,0 +1,228 @@
+Searcher = function(data) {
+  this.data = data;
+  this.handlers = [];
+}
+
+Searcher.prototype = new function() {
+  // search is performed in chunks of 1000 for non-blocking user input
+  var CHUNK_SIZE = 1000;
+  // do not try to find more than 100 results
+  var MAX_RESULTS = 100;
+  var huid = 1;
+  var suid = 1;
+  var runs = 0;
+
+  this.find = function(query) {
+    var queries = splitQuery(query);
+    var regexps = buildRegexps(queries);
+    var highlighters = buildHilighters(queries);
+    var state = { from: 0, pass: 0, limit: MAX_RESULTS, n: suid++};
+    var _this = this;
+
+    this.currentSuid = state.n;
+
+    if (!query) return;
+
+    var run = function() {
+      // stop current search thread if new search started
+      if (state.n != _this.currentSuid) return;
+
+      var results =
+        performSearch(_this.data, regexps, queries, highlighters, state);
+      var hasMore = (state.limit > 0 && state.pass < 4);
+
+      triggerResults.call(_this, results, !hasMore);
+      if (hasMore) {
+        setTimeout(run, 2);
+      }
+      runs++;
+    };
+    runs = 0;
+
+    // start search thread
+    run();
+  }
+
+  /*  ----- Events ------  */
+  this.ready = function(fn) {
+    fn.huid = huid;
+    this.handlers.push(fn);
+  }
+
+  /*  ----- Utilities ------  */
+  function splitQuery(query) {
+    return jQuery.grep(query.split(/(\s+|::?|\(\)?)/), function(string) {
+      return string.match(/\S/);
+    });
+  }
+
+  function buildRegexps(queries) {
+    return jQuery.map(queries, function(query) {
+      return new RegExp(query.replace(/(.)/g, '([$1])([^$1]*?)'), 'i');
+    });
+  }
+
+  function buildHilighters(queries) {
+    return jQuery.map(queries, function(query) {
+      return jQuery.map(query.split(''), function(l, i) {
+        return '\u0001$' + (i*2+1) + '\u0002$' + (i*2+2);
+      }).join('');
+    });
+  }
+
+  // function longMatchRegexp(index, longIndex, regexps) {
+  //     for (var i = regexps.length - 1; i >= 0; i--){
+  //         if (!index.match(regexps[i]) && !longIndex.match(regexps[i])) return false;
+  //     };
+  //     return true;
+  // }
+
+
+  /*  ----- Mathchers ------  */
+
+  /*
+   * This record matches if the index starts with queries[0] and the record
+   * matches all of the regexps
+   */
+  function matchPassBeginning(index, longIndex, queries, regexps) {
+    if (index.indexOf(queries[0]) != 0) return false;
+    for (var i=1, l = regexps.length; i < l; i++) {
+      if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
+        return false;
+    };
+    return true;
+  }
+
+  /*
+   * This record matches if the longIndex starts with queries[0] and the
+   * longIndex matches all of the regexps
+   */
+  function matchPassLongIndex(index, longIndex, queries, regexps) {
+    if (longIndex.indexOf(queries[0]) != 0) return false;
+    for (var i=1, l = regexps.length; i < l; i++) {
+      if (!longIndex.match(regexps[i]))
+        return false;
+    };
+    return true;
+  }
+
+  /*
+   * This record matches if the index contains queries[0] and the record
+   * matches all of the regexps
+   */
+  function matchPassContains(index, longIndex, queries, regexps) {
+    if (index.indexOf(queries[0]) == -1) return false;
+    for (var i=1, l = regexps.length; i < l; i++) {
+      if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
+        return false;
+    };
+    return true;
+  }
+
+  /*
+   * This record matches if regexps[0] matches the index and the record
+   * matches all of the regexps
+   */
+  function matchPassRegexp(index, longIndex, queries, regexps) {
+    if (!index.match(regexps[0])) return false;
+    for (var i=1, l = regexps.length; i < l; i++) {
+      if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
+        return false;
+    };
+    return true;
+  }
+
+
+  /*  ----- Highlighters ------  */
+  function highlightRegexp(info, queries, regexps, highlighters) {
+    var result = createResult(info);
+    for (var i=0, l = regexps.length; i < l; i++) {
+      result.title = result.title.replace(regexps[i], highlighters[i]);
+      result.namespace = result.namespace.replace(regexps[i], highlighters[i]);
+    };
+    return result;
+  }
+
+  function hltSubstring(string, pos, length) {
+    return string.substring(0, pos) + '\u0001' + string.substring(pos, pos + length) + '\u0002' + string.substring(pos + length);
+  }
+
+  function highlightQuery(info, queries, regexps, highlighters) {
+    var result = createResult(info);
+    var pos = 0;
+    var lcTitle = result.title.toLowerCase();
+
+    pos = lcTitle.indexOf(queries[0]);
+    if (pos != -1) {
+      result.title = hltSubstring(result.title, pos, queries[0].length);
+    }
+
+    result.namespace = result.namespace.replace(regexps[0], highlighters[0]);
+    for (var i=1, l = regexps.length; i < l; i++) {
+      result.title = result.title.replace(regexps[i], highlighters[i]);
+      result.namespace = result.namespace.replace(regexps[i], highlighters[i]);
+    };
+    return result;
+  }
+
+  function createResult(info) {
+    var result = {};
+    result.title = info[0];
+    result.namespace = info[1];
+    result.path = info[2];
+    result.params = info[3];
+    result.snippet = info[4];
+    return result;
+  }
+
+  /*  ----- Searching ------  */
+  function performSearch(data, regexps, queries, highlighters, state) {
+    var searchIndex = data.searchIndex;
+    var longSearchIndex = data.longSearchIndex;
+    var info = data.info;
+    var result = [];
+    var i = state.from;
+    var l = searchIndex.length;
+    var togo = CHUNK_SIZE;
+    var matchFunc, hltFunc;
+
+    while (state.pass < 4 && state.limit > 0 && togo > 0) {
+      if (state.pass == 0) {
+        matchFunc = matchPassBeginning;
+        hltFunc = highlightQuery;
+      } else if (state.pass == 1) {
+        matchFunc = matchPassLongIndex;
+        hltFunc = highlightQuery;
+      } else if (state.pass == 2) {
+        matchFunc = matchPassContains;
+        hltFunc = highlightQuery;
+      } else if (state.pass == 3) {
+        matchFunc = matchPassRegexp;
+        hltFunc = highlightRegexp;
+      }
+
+      for (; togo > 0 && i < l && state.limit > 0; i++, togo--) {
+        if (info[i].n == state.n) continue;
+        if (matchFunc(searchIndex[i], longSearchIndex[i], queries, regexps)) {
+          info[i].n = state.n;
+          result.push(hltFunc(info[i], queries, regexps, highlighters));
+          state.limit--;
+        }
+      };
+      if (searchIndex.length <= i) {
+        state.pass++;
+        i = state.from = 0;
+      } else {
+        state.from = i;
+      }
+    }
+    return result;
+  }
+
+  function triggerResults(results, isLast) {
+    jQuery.each(this.handlers, function(i, fn) {
+      fn.call(this, results, isLast)
+    })
+  }
+}
+

data/doc/panel/index.html

@@ -0,0 +1,73 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN"
+	"http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
+<head>
+	<title>search index</title>
+	<link rel="stylesheet" href="../css/reset.css" type="text/css" media="screen" charset="utf-8" />
+	<link rel="stylesheet" href="../css/panel.css" type="text/css" media="screen" charset="utf-8" />
+	<script src="../js/search_index.js" type="text/javascript" charset="utf-8"></script>
+	<script src="../js/searcher.js" type="text/javascript" charset="utf-8"></script>
+	<script src="tree.js" type="text/javascript" charset="utf-8"></script>
+	<script src="../js/jquery-1.3.2.min.js" type="text/javascript" charset="utf-8"></script>
+	<script src="../js/searchdoc.js" type="text/javascript" charset="utf-8"></script>
+	<script type="text/javascript" charset="utf-8">
+    function placeholder() {
+        if ($('<input type="text">')[0].placeholder !== undefined) return;
+
+        $('#search-label').click(function() {
+            $('#search').focus();
+            $('#search-label').hide();
+        });
+
+        $('#search').focus(function() {
+            $('#search-label').hide();
+        });
+        $('#search').blur(function() {
+            this.value == '' && $('#search-label').show()
+        });
+
+        $('#search')[0].value == '' && $('#search-label').show();
+    }
+    $(function() {
+        placeholder();
+        $('#links').hide();
+        var panel = new Searchdoc.Panel($('#panel'), search_data, tree, window.parent.frames[1]);
+        $('#search').focus();
+
+        var s = window.parent.location.search.match(/\?q=([^&]+)/);
+        if (s) {
+            s = decodeURIComponent(s[1]).replace(/\+/g, ' ');
+            if (s.length > 0)
+            {
+                $('#search').val(s);
+                panel.search(s, true);
+            }
+        }
+    })
+	</script>
+</head>
+<body>
+    <div class="panel panel_tree" id="panel">
+        <div class="header">
+            <div>
+                <label for="search" id="search-label" style="display: none">Search</label>
+                <table>
+                <tr><td>
+                    <input type="Search" placeholder="Search" autosave="searchdoc" results="10" id="search" autocomplete="off"/>
+                </td></tr>
+            </table></div>
+        </div>
+        <div class="tree">
+            <ul>
+            </ul>
+        </div>
+        <div class="result">
+            <ul>
+            </ul>
+        </div>
+    </div>
+    <a href="links.html" id="links">index</a>
+</body>
+</html>

data/doc/panel/links.html

@@ -0,0 +1,34 @@
+<html>
+    <head>File index</head>
+    <body>
+    
+      <a href="../files/README_rdoc.html">README.rdoc</a>
+    
+      <a href="../files/ext/bitboard_c.html">ext/bitboard.c</a>
+    
+      <a href="../files/ext/board_c.html">ext/board.c</a>
+    
+      <a href="../files/ext/chess_c.html">ext/chess.c</a>
+    
+      <a href="../files/ext/common_c.html">ext/common.c</a>
+    
+      <a href="../files/ext/game_c.html">ext/game.c</a>
+    
+      <a href="../files/ext/special_c.html">ext/special.c</a>
+    
+      <a href="../files/lib/chess_rb.html">lib/chess.rb</a>
+    
+      <a href="../files/lib/chess/exceptions_rb.html">lib/chess/exceptions.rb</a>
+    
+      <a href="../files/lib/chess/game_rb.html">lib/chess/game.rb</a>
+    
+      <a href="../files/lib/chess/gnuchess_rb.html">lib/chess/gnuchess.rb</a>
+    
+      <a href="../files/lib/chess/pgn_rb.html">lib/chess/pgn.rb</a>
+    
+      <a href="../files/lib/chess/utf8_notation_rb.html">lib/chess/utf8_notation.rb</a>
+    
+      <a href="../files/lib/chess/version_rb.html">lib/chess/version.rb</a>
+    
+    </body>
+</html>

data/doc/panel/tree.js

@@ -0,0 +1 @@
+var tree = [["","","files",[["README.rdoc","files/README_rdoc.html","",[]],["","","ext",[["bitboard.c","files/ext/bitboard_c.html","",[]],["board.c","files/ext/board_c.html","",[]],["chess.c","files/ext/chess_c.html","",[]],["common.c","files/ext/common_c.html","",[]],["game.c","files/ext/game_c.html","",[]],["special.c","files/ext/special_c.html","",[]]]],["","","lib",[["","","chess",[["exceptions.rb","files/lib/chess/exceptions_rb.html","",[]],["game.rb","files/lib/chess/game_rb.html","",[]],["gnuchess.rb","files/lib/chess/gnuchess_rb.html","",[]],["pgn.rb","files/lib/chess/pgn_rb.html","",[]],["utf8_notation.rb","files/lib/chess/utf8_notation_rb.html","",[]],["version.rb","files/lib/chess/version_rb.html","",[]]]],["chess.rb","files/lib/chess_rb.html","",[]]]]]],["Chess","classes/Chess.html","",[["BadNotationError","classes/Chess/BadNotationError.html"," < StandardError",[]],["Board","classes/Chess/Board.html"," < Object",[]],["CGame","classes/Chess/CGame.html"," < Object",[]],["Game","classes/Chess/Game.html"," < Chess::CGame",[]],["Gnuchess","classes/Chess/Gnuchess.html","",[]],["IllegalMoveError","classes/Chess/IllegalMoveError.html"," < StandardError",[]],["InvalidFenFormatError","classes/Chess/InvalidFenFormatError.html"," < StandardError",[]],["InvalidPgnFormatError","classes/Chess/InvalidPgnFormatError.html"," < StandardError",[]],["Pgn","classes/Chess/Pgn.html"," < Object",[]],["UTF8Notation","classes/Chess/UTF8Notation.html","",[]]]]]

data/ext/chess.c

@@ -31,7 +31,8 @@ game_alloc (VALUE class)
  * Set the game position with a FEN string.
  *
  * Parameters are:
- * +fen+:: the FEN (Forsyth–Edwards Notation) string notation used to set the game position.
+ * +fen+:: the FEN (Forsyth–Edwards Notation) string notation used to set the
+ *         game position.
  */
 VALUE
 game_set_fen (VALUE self, VALUE fen)
@@ -49,14 +50,26 @@ game_set_fen (VALUE self, VALUE fen)
  *
  * Parameters are:
  * +piece+:: the character of the moving piece <em>('P', 'R', 'N', 'B', 'Q', 'K')</em>.
- * +disambiguating+:: when two (or more) identical pieces can move to the same square, the moving piece is uniquely identified by specifying the piece's letter, followed by (in descending order of preference):
- *                    1. the file of departure (if they differ); or
- *                    2. the rank of departure (if the files are the same but the ranks differ); or
- *                    3. both the rank and file (if neither alone is sufficient to identify the piece—which occurs only in rare cases where one or more pawns have promoted, resulting in a player having three or more identical pieces able to reach the same square).
+ * +disambiguating+:: when two (or more) identical pieces can move to the same
+ *                    square, the moving piece is uniquely identified by
+ *                    specifying the piece's letter, followed by (in descending
+ *                    order of preference):
+ *                    * the file of departure (if they differ); or
+ *                    * the rank of departure (if the files are the same but
+ *                      the ranks differ); or
+ *                    * both the rank and file (if neither alone is
+ *                      sufficient to identify the piece—which occurs only in
+ *                      rare cases where one or more pawns have promoted,
+ *                      resulting in a player having three or more identical
+ *                      pieces able to reach the same square).
  *                    Keep blank if no needed.
  * +to_coord+:: the square where the moving piece will <em>('a1', 'a2', ... , 'h7', 'h8')</em>.
- * +promote_in+:: the character of promotion piece <em>('R', 'N', 'B', 'Q')</em>. If no promotion occured, this param will be ignored. If no value is passed, 'Q' is the default.
- * This method returns a string that represents the short algebraic chess notation of the move or raise an IllegalMoveError if the move is illegal.
+ * +promote_in+:: the character of promotion piece <em>('R', 'N', 'B', 'Q')</em>.
+ *                If no promotion occured, this param will be ignored. If no
+ *                value is passed, 'Q' is the default.
+ *
+ * This method returns a string that represents the short algebraic chess
+ * notation of the move or raise an IllegalMoveError if the move is illegal.
  */
 VALUE
 game_move (VALUE self, VALUE rb_piece, VALUE rb_disambiguating, VALUE rb_to_coord, VALUE rb_promote_in)
@@ -83,10 +96,16 @@ game_move (VALUE self, VALUE rb_piece, VALUE rb_disambiguating, VALUE rb_to_coor
  * Make a move. This add a new Board in the Game.
  *
  * Parameters are:
- * +from+:: the 2 character string representing the starting square of the moving piece <em>('a1', 'a2', ... , 'h7', 'h8')</em>.
- * +to+:: the 2 character string representing the ending square of the moving piece <em>('a1', 'a2', ... , 'h7', 'h8')</em>.
- * +promote_in+:: the character of promotion piece <em>('R', 'N', 'B', 'Q')</em>. If no promotion occured, this param will be ignored. If no value is passed, 'Q' is the default.
- * This method returns a string that represents the short algebraic chess notation of the move or raise an IllegalMoveError if the move is illegal.
+ * +from+:: the 2 character string representing the starting square of the
+ *          moving piece <em>('a1', 'a2', ... , 'h7', 'h8')</em>.
+ * +to+:: the 2 character string representing the ending square of the moving
+ *        piece <em>('a1', 'a2', ... , 'h7', 'h8')</em>.
+ * +promote_in+:: the character of promotion piece <em>('R', 'N', 'B', 'Q')</em>.
+ *                If no promotion occured, this param will be ignored. If no
+ *                value is passed, 'Q' is the default.
+ *
+ * This method returns a string that represents the short algebraic chess
+ * notation of the move or raise an IllegalMoveError if the move is illegal.
  */
 VALUE
 game_move2 (VALUE self, VALUE rb_from, VALUE rb_to, VALUE rb_promote_in)
@@ -108,7 +127,8 @@ game_move2 (VALUE self, VALUE rb_from, VALUE rb_to, VALUE rb_promote_in)
  *
  * Make a move. This add a new Board in the Game.
  *
- * Each square on the chessboard is represented by an integer according to the following scheme:
+ * Each square on the chessboard is represented by an integer according to the
+ * following scheme:
  *    8 | 56 57 58 59 60 61 62 63
  *    7 | 48 49 50 51 52 53 54 55
  *    6 | 40 41 42 43 44 45 46 47
@@ -119,11 +139,16 @@ game_move2 (VALUE self, VALUE rb_from, VALUE rb_to, VALUE rb_promote_in)
  *    1 |  0  1  2  3  4  5  6  7
  *      +-------------------------
  *         a  b  c  d  e  f  g  h
+ *
  * Parameters are:
  * +from+:: the integer representing the starting square of the moving piece.
  * +to+:: the integer representing the ending square of the moving piece.
- * +promote_in+:: the character of promotion piece <em>('R', 'N', 'B', 'Q')</em>. If no promotion occured, this param will be ignored. If no value is passed, 'Q' is the default.
- * This method returns a string that represents the short algebraic chess notation of the move or raise an IllegalMoveError if the move is illegal.
+ * +promote_in+:: the character of promotion piece <em>('R', 'N', 'B', 'Q')</em>.
+ *                If no promotion occured, this param will be ignored. If no
+ *                value is passed, 'Q' is the default.
+ *
+ * This method returns a string that represents the short algebraic chess
+ * notation of the move or raise an IllegalMoveError if the move is illegal.
  */
 VALUE
 game_move3 (VALUE self, VALUE rb_from, VALUE rb_to, VALUE rb_promote_in)
@@ -143,10 +168,12 @@ game_move3 (VALUE self, VALUE rb_from, VALUE rb_to, VALUE rb_promote_in)
 /*
  * call-seq: resign(color)
  *
- * The game result is set to '1-0' if +color+ is "black", otherwise is set to '0-1' if color is "white".
+ * The game result is set to '1-0' if +color+ is "black", otherwise is set to
+ * '0-1' if color is "white".
  *
  * Parameters are:
- * +color+:: the color of the player who resigns the game; it can be +:white+ or +:black+.
+ * +color+:: the color of the player who resigns the game; it can be +:white+ or
+ *           +:black+.
  */
 VALUE
 game_resign (VALUE self, VALUE color)
@@ -182,7 +209,8 @@ game_draw (VALUE self)
 /*
  * call-seq: [n]
  *
- * Returns the +n+-th Board of the Game or +nil+ if the +n+-th Board does not exist.
+ * Returns the +n+-th Board of the Game or +nil+ if the +n+-th Board does not
+ * exist.
  */
 VALUE
 game_boards (VALUE self, VALUE index)
@@ -199,7 +227,8 @@ game_boards (VALUE self, VALUE index)
 /*
  * call-seq: current
  *
- * Returns the current Board of the Game (the current chess position of the game).
+ * Returns the current Board of the Game (the current chess position of the
+ * game).
  */
 VALUE
 game_current_board (VALUE self)
@@ -227,26 +256,34 @@ game_moves (VALUE self)
 }
 
 /*
- * call-seq: full_moves
+ * call-seq: coord_moves
  *
- * Returns the array with all full moves done <em>(es: b1c3)</em>.
+ * Returns the array with all moves done in coordinate chess notation <em>(es: b1c3)</em>.
  */
 VALUE
-game_full_moves (VALUE self)
+game_coord_moves (VALUE self)
 {
   Game *g;
   Data_Get_Struct (self, Game, g);
   int i;
   VALUE moves = rb_ary_new ();
   for (i = 0; i < g->current; i++)
-    rb_ary_push (moves, rb_str_new2 (g->full_moves[i]));
+    rb_ary_push (moves, rb_str_new2 (g->coord_moves[i]));
   return moves;
 }
 
+VALUE
+game_full_moves (VALUE self)
+{
+  printf ("DEPRECATION WARNING: `full_moves` is deprecated and will be removed, please use `coord_moves` to get the array with all moves done in coordinate chess notation.\n");
+  return game_coord_moves (self);
+}
+
 /*
  * call-seq: threefold_repetition?
  *
- * Returns +true+ if a player can claim draw by the threefold repetition rule, +false+ otherwise.
+ * Returns +true+ if a player can claim draw by the threefold repetition rule,
+ * +false+ otherwise.
  */
 VALUE
 game_threefold_repetition (VALUE self)
@@ -309,7 +346,7 @@ game_each (VALUE self)
   Data_Get_Struct (self, Game, g);
   for (i = 0; i < g->current; i++)
     rb_yield_values (4, Data_Wrap_Struct (board_klass, 0, 0, get_board (g, i)),
-                     rb_str_new2 (g->moves[i]), rb_str_new2 (g->full_moves[i]),
+                     rb_str_new2 (g->moves[i]), rb_str_new2 (g->coord_moves[i]),
                      INT2FIX (i));
   return self;
 }
@@ -389,7 +426,8 @@ board_placement (VALUE self)
  * Returns the piece on the +square+ of the chessboard. If there is no piece or
  * the square is not valid return the blank string.
  *
- * Each square on the chessboard is represented by an integer according to the following scheme:
+ * Each square on the chessboard is represented by an integer according to the
+ * following scheme:
  *    8 | 56 57 58 59 60 61 62 63
  *    7 | 48 49 50 51 52 53 54 55
  *    6 | 40 41 42 43 44 45 46 47
@@ -424,7 +462,8 @@ board_get_piece (VALUE self, VALUE square)
 /*
  * call-seq: check?
  *
- * Returns +true+ if the king of the color that has the turn is in check, +false+ otherwise.
+ * Returns +true+ if the king of the color that has the turn is in check,
+ * +false+ otherwise.
  */
 VALUE
 board_king_in_check (VALUE self)
@@ -440,7 +479,8 @@ board_king_in_check (VALUE self)
 /*
  * call-seq: checkmate?
  *
- * Returns +true+ if the king of the color that has the turn is in checkmate, +false+ otherwise.
+ * Returns +true+ if the king of the color that has the turn is in checkmate,
+ * +false+ otherwise.
  */
 VALUE
 board_king_in_checkmate (VALUE self)
@@ -456,7 +496,8 @@ board_king_in_checkmate (VALUE self)
 /*
  * call-seq: stalemate?
  *
- * Returns +true+ if the pieces of the color that has the turn are in stalemate, +false+ otherwise.
+ * Returns +true+ if the pieces of the color that has the turn are in stalemate,
+ * +false+ otherwise.
  */
 VALUE
 board_stalemate (VALUE self)
@@ -472,7 +513,8 @@ board_stalemate (VALUE self)
 /*
  * call-seq: insufficient_material?
  *
- * Returns +true+ if the board has insufficient material to checkmate, +false+ otherwise.
+ * Returns +true+ if the board has insufficient material to checkmate, +false+
+ * otherwise.
  */
 VALUE
 board_insufficient_material (VALUE self)
@@ -488,7 +530,8 @@ board_insufficient_material (VALUE self)
 /*
  * call-seq: fifty_move_rule?
  *
- * Returns +true+ if a player can claim draw by the fifty-move rule, +false+ otherwise.
+ * Returns +true+ if a player can claim draw by the fifty-move rule, +false+
+ * otherwise.
  */
 VALUE
 board_fifty_move_rule (VALUE self)
@@ -520,7 +563,9 @@ board_active_color (VALUE self)
 /*
  * call-seq: halfmove_clock
  *
- * Returns the halfmove clock that is the number of halfmoves since the last pawn advance or capture. This is used to determine if a draw can be claimed under the fifty-move rule.
+ * Returns the halfmove clock that is the number of halfmoves since the last
+ * pawn advance or capture. This is used to determine if a draw can be claimed
+ * under the fifty-move rule.
  */
 VALUE
 board_halfmove_clock (VALUE self)
@@ -533,7 +578,8 @@ board_halfmove_clock (VALUE self)
 /*
  * call-seq: fullmove_number
  *
- * Returns the fullmove number: the number of the full move. It starts at 1, and is incremented after black's move.
+ * Returns the fullmove number: the number of the full move. It starts at 1, and
+ * is incremented after black's move.
  */
 VALUE
 board_fullmove_number (VALUE self)
@@ -597,6 +643,7 @@ Init_chess ()
   rb_define_method (game, "[]", game_boards, 1);
   rb_define_method (game, "current", game_current_board, 0);
   rb_define_method (game, "moves", game_moves, 0);
+  rb_define_method (game, "coord_moves", game_coord_moves, 0);
   rb_define_method (game, "full_moves", game_full_moves, 0);
   rb_define_method (game, "threefold_repetition?", game_threefold_repetition, 0);
   rb_define_method (game, "result", game_result, 0);
@@ -608,7 +655,9 @@ Init_chess ()
 
   /*
    * This class rappresents a chess board.
-   * The rappresentation of the board use _bitboards_ where each bit represents a game position or state, designed for optimization of speed and/or memory or disk use in mass calculations.
+   * The rappresentation of the board use _bitboards_ where each bit represents
+   * a game position or state, designed for optimization of speed and/or memory
+   * or disk use in mass calculations.
    * This ensures a fast library.
    */
   board_klass = rb_define_class_under (chess, "Board", rb_cObject);