chess 0.0.1.dummy → 0.0.1

data/.gitignore

@@ -1,4 +1,10 @@
 *.gem
 .bundle
+doc
+ext/chess
+ext/Makefile
+ext/*.bundle
+ext/*.o
 Gemfile.lock
+main.rb
 pkg/*

data/LICENSE

@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.

data/README.rdoc

@@ -0,0 +1,40 @@
+= Chess
+
+A fast Ruby library to play chess with Ruby.
+This library is quite fast because rappresent
+the game situations with bitboards. In addition, the
+move generator is written in C as a Ruby extension.
+
+== Installation
+
+    gem install chess
+
+== Usage
+
+  require 'chess'
+  g = Chess::Game.new
+  while (!g.over?)
+    begin
+      print "Give me a #{g.active_player} move: "
+      input = gets.chop
+      break if input == 'quit'
+      g << input
+      puts g.board
+      puts g.moves.last
+    rescue Chess::IllegalMoveError => e
+      puts 'Illegal move!'
+    end
+  end
+  puts g.status
+
+Documentation is available {here}[http://pioz.github.com/chess].
+
+== Questions or problems?
+
+If you have any issues please add an {issue on GitHub}[https://github.com/pioz/chess/issues]
+or fork the project and send a pull request.
+
+== Copyright
+
+Copyright (c) 2012 {Enrico Pilotto (@pioz)}[https://github.com/pioz].
+See {LICENSE}[https://github.com/pioz/chess/blob/master/LICENSE] for details.

data/Rakefile

@@ -1 +1,17 @@
-require "bundler/gem_tasks"
+require 'bundler/gem_tasks'
+
+require 'rdoc/task'
+Rake::RDocTask.new do |rd|
+  rd.title = 'Chess'
+  rd.main = 'README.rdoc'
+  rd.rdoc_dir = 'doc'
+  rd.rdoc_files.include('README.rdoc', 'lib/**/*.rb', 'ext/*.c')
+  rd.options << '-f' << 'horo'
+end
+
+require 'rake/testtask'
+task :default => :test
+Rake::TestTask.new do |test|
+  test.libs << 'test'
+  test.test_files = FileList["test/test_#{ENV['T'] || '*'}.rb"]
+end

data/chess.gemspec

@@ -1,23 +1,22 @@
 # -*- encoding: utf-8 -*-
-$:.push File.expand_path("../lib", __FILE__)
-require "chess/version"
+$:.push File.expand_path('../lib', __FILE__)
+require 'chess/version'
 
 Gem::Specification.new do |s|
-  s.name        = "chess"
+  s.name        = 'chess'
   s.version     = Chess::VERSION
-  s.authors     = ["Enrico Pilotto"]
-  s.email       = ["enrico@megiston.it"]
-  s.homepage    = ""
-  s.summary     = %q{Dummy gem.}
-  s.description = %q{Dummy gem.}
+  s.authors     = ['Enrico Pilotto']
+  s.email       = ['enrico@megiston.it']
+  s.homepage    = 'https://github.com/pioz/chess'
+  s.summary     = %q{A fast chess library to play chess with Ruby.}
+  s.description = %q{A fast chess library that use bitboards to play chess with Ruby.}
+  s.license     = 'LGPLv3'
 
-  s.rubyforge_project = "chess"
+  s.rubyforge_project = 'chess'
 
   s.files         = `git ls-files`.split("\n")
   s.test_files    = `git ls-files -- {test,spec,features}/*`.split("\n")
   s.executables   = `git ls-files -- bin/*`.split("\n").map{ |f| File.basename(f) }
-  s.require_paths = ["lib"]
-
-  s.post_install_message = "This is a dummy gem only to reserve the name on rubygems.org"
-
+  s.extensions    = ['ext/extconf.rb']
+  s.require_paths = ['lib']
 end

data/ext/MakefileC

@@ -0,0 +1,22 @@
+# Compile this C chess library
+
+chess:		bitboard.o board.o common.o game.o special.o
+		gcc -g -o chess bitboard.o board.o common.o game.o special.o
+
+bitboard.o:	bitboard.h bitboard.c
+		gcc -g -c bitboard.c -o bitboard.o
+
+board.o:	board.h board.c
+		gcc -g -c board.c -o board.o
+
+common.o:	common.h common.c  
+		gcc -g -c common.c -o common.o
+
+game.o:		game.h game.c  
+		gcc -g -c game.c -o game.o
+
+special.o:	special.h special.c  
+		gcc -g -c special.c -o special.o
+
+clean:
+		rm *.o

data/ext/bitboard.c

@@ -0,0 +1,376 @@
+/*
+ * chess - a fast library to play chess in Ruby
+ *
+ * Copyright (c) 2011-2012, Enrico Pilotto <enrico@megiston.it>
+ * This code is under LICENSE LGPLv3
+ */
+
+#include "bitboard.h"
+
+// Pre-calculate variables
+bboard ALL_XRAY_ATTACK_WHITE_PAWN[64];
+bboard ALL_XRAY_ATTACK_BLACK_PAWN[64];
+bboard ALL_XRAY_KNIGHT[64];
+bboard ALL_XRAY_KING[64];
+
+/*
+  Shift by direction
+   [7]      [0]      [1]
+       +7   +8    +9
+          \  |  /
+   [6] -1 <- X -> +1 [2]
+          /  |  \
+       -9   -8    -7
+   [5]      [4]      [3]
+ */
+const int DIR[8] = { 8, 9, 1, -7, -8, -9, -1, 7 };
+
+/*
+  Avoid wrap bitboard masks
+   [7] -> +7           [0] -> +8           [1] -> +9
+   0x7F7F7F7F7F7F7F00  0xFFFFFFFFFFFFFF00  0xFEFEFEFEFEFEFE00
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   . . . . . . . .     . . . . . . . .     . . . . . . . .
+
+   [6] -> -1                               [2] -> +1
+   0x7F7F7F7F7F7F7F7F                      0xFEFEFEFEFEFEFEFE
+   1 1 1 1 1 1 1 .                         . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .                         . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .                         . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .                         . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .                         . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .                         . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .                         . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .                         . 1 1 1 1 1 1 1
+
+   [5] -> -9           [4] -> -8           [3] -> -7
+   0x007F7F7F7F7F7F7F  0x00FFFFFFFFFFFFFF  0x00FEFEFEFEFEFEFE
+   . . . . . . . .     . . . . . . . .     . . . . . . . .
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+   1 1 1 1 1 1 1 .     1 1 1 1 1 1 1 1     . 1 1 1 1 1 1 1
+ */
+const bboard AVOID_WRAP[8] =
+{
+  0xffffffffffffff00,
+  0xfefefefefefefe00,
+  0xfefefefefefefefe,
+  0x00fefefefefefefe,
+  0x00ffffffffffffff,
+  0x007f7f7f7f7f7f7f,
+  0x7f7f7f7f7f7f7f7f,
+  0x7f7f7f7f7f7f7f00
+};
+
+// Bitboard getters
+int
+square (int file, int rank)
+{
+  return 8 * rank + file;
+}
+
+int
+square2 (bboard b)
+{
+  int pos = -1;
+  while (b)
+    {
+      b >>= 1;
+      pos++;
+    }
+  return pos;
+}
+
+void
+squares (bboard b, int *array, int *n)
+{
+  int i;
+  *n = 0;
+  for (i = 0; i < 64; i++)
+    if (b & 1ULL << i)
+      {
+        array[*n] = i;
+        (*n)++;
+      }
+}
+
+int
+file (int square)
+{
+  return square & 7;
+}
+
+int rank (int square)
+{
+  return square >> 3;
+}
+
+bboard
+get (bboard b, int square)
+{
+  return b & (1ULL << square);
+}
+
+bboard
+get2 (bboard b, int file, int rank)
+{
+  return b & (1ULL << (8 * rank + file));
+}
+
+void
+print_bitboard (bboard b)
+{
+  int i, j;
+  for (i = 7; i >= 0; i--) // rank => top to bottom
+    {
+      for (j = 0; j < 8; j++) // file => left to right
+        printf ("%d ", get2 (b, j, i) ? 1 : 0);
+      printf ("\n");
+    }
+}
+
+// Bitboard manipulations
+
+bboard
+has_only_one_one (bboard b)
+{
+  return b && !(b & (b-1));
+}
+
+bboard
+only_white_squares (bboard b)
+{
+  return !((b ^ WHITE_SQUARES) & b);
+}
+
+bboard
+only_black_squares (bboard b)
+{
+  return !((b ^ BLACK_SQUARES) & b);
+}
+
+bboard
+mirror_horizontal (bboard b)
+{
+  const bboard k1 = 0x5555555555555555;
+  const bboard k2 = 0x3333333333333333;
+  const bboard k3 = 0x0f0f0f0f0f0f0f0f;
+  b = ((b >> 1) & k1) +  2 * (b & k1);
+  b = ((b >> 2) & k2) +  4 * (b & k2);
+  b = ((b >> 4) & k3) + 16 * (b & k3);
+  return b;
+}
+
+bboard
+mirror_vertical (bboard b)
+{
+  const bboard k1 = 0x00ff00ff00ff00ff;
+  const bboard k2 = 0x0000ffff0000ffff;
+  b = ((b >>  8) & k1) | ((b & k1) <<  8);
+  b = ((b >> 16) & k2) | ((b & k2) << 16);
+  b = ( b >> 32)       | ( b       << 32);
+  return b;
+}
+
+bboard
+rotate_left (bboard b, int s)
+{
+  //return (b << s) | (b >> (64 - s));
+  //return (b << s) | (b >> -s);
+  return s > 0 ? b << s : b >> -s;
+}
+
+bboard
+rotate_right (bboard b, int s)
+{
+  //return (b >> s) | (b << (64 - s));
+  //return (b >> s) | (b << -s);
+  return s > 0 ? b >> s : b << -s;
+}
+
+bboard
+occluded_fill (bboard gen, bboard pro, int dir)
+{
+   int r = DIR[dir];
+   pro &= AVOID_WRAP[dir];
+   gen |= pro & rotate_left (gen, r);
+   pro &=       rotate_left (pro, r);
+   gen |= pro & rotate_left (gen, 2 * r);
+   pro &=       rotate_left (pro, 2 * r);
+   gen |= pro & rotate_left (gen, 4 * r);
+   return gen;
+}
+
+bboard
+shift_one (bboard b, int dir)
+{
+  return rotate_left (b, DIR[dir]) & AVOID_WRAP[dir];
+}
+
+bboard
+sliding_attacks (bboard slider, bboard propagator, int dir)
+{
+  bboard fill = occluded_fill (slider, propagator, dir);
+  return shift_one (fill, dir);
+}
+
+// Pre-calculators
+void
+precalculate_xray_attack_white_pawn (bboard xray[64])
+{
+  int i;
+  for (i = 0; i < 64; i++)
+    {
+      xray[i] = EMPTY_BOARD;
+      xray[i] = shift_one (1ULL << i, 7) | shift_one (1ULL << i, 1);
+    }
+}
+
+void
+precalculate_xray_attack_black_pawn (bboard xray[64])
+{
+  int i;
+  for (i = 0; i < 64; i++)
+    {
+      xray[i] = EMPTY_BOARD;
+      xray[i] = shift_one (1ULL << i, 5) | shift_one (1ULL << i, 3);
+    }
+}
+
+void
+precalculate_xray_knight (bboard xray[64])
+{
+  int i;
+  for (i = 0; i < 64; i++)
+    {
+      xray[i] = 1ULL << i;
+      xray[i] = ((xray[i] << 17) & NOT_FILE_A)
+        | ((xray[i] << 10) & NOT_FILE_AB)
+        | ((xray[i] >>  6) & NOT_FILE_AB)
+        | ((xray[i] >> 15) & NOT_FILE_A)
+        | ((xray[i] << 15) & NOT_FILE_H)
+        | ((xray[i] <<  6) & NOT_FILE_GH)
+        | ((xray[i] >> 10) & NOT_FILE_GH)
+        | ((xray[i] >> 17) & NOT_FILE_H);
+    }
+}
+
+void
+precalculate_xray_king (bboard xray[64])
+{
+  int i, j;
+  for (i = 0; i < 64; i++)
+    {
+      xray[i] = EMPTY_BOARD;
+      for (j = 0; j < 8; j++)
+        xray[i] = sliding_attacks (1ULL << i, EMPTY_BOARD, j) | xray[i];
+    }
+}
+
+void
+precalculate_all_xray ()
+{
+  precalculate_xray_attack_white_pawn (ALL_XRAY_ATTACK_WHITE_PAWN);
+  precalculate_xray_attack_black_pawn (ALL_XRAY_ATTACK_BLACK_PAWN);
+  precalculate_xray_knight (ALL_XRAY_KNIGHT);
+  precalculate_xray_king (ALL_XRAY_KING);
+}
+
+// XRay generators
+bboard
+xray_white_pawn (bboard occupied_square, int square)
+{
+  bboard empty_square = ~occupied_square;
+  bboard one_step = shift_one (1ULL << square, 0) & empty_square;
+  if (square > 7 && square < 16)
+    {
+      bboard two_step = shift_one (1ULL << (square + 8), 0) & empty_square & ~shift_one (occupied_square, 0);
+      return one_step | two_step | (ALL_XRAY_ATTACK_WHITE_PAWN[square] & occupied_square);
+    }
+  return one_step | (ALL_XRAY_ATTACK_WHITE_PAWN[square] & occupied_square);
+}
+
+bboard
+xray_black_pawn (bboard occupied_square, int square)
+{
+  bboard empty_square = ~occupied_square;
+  bboard one_step = shift_one (1ULL << square, 4) & empty_square;
+  if (square > 47 && square < 56)
+    {
+      bboard two_step = shift_one (1ULL << (square - 8), 4) & empty_square & ~shift_one (occupied_square, 4);
+      return one_step | two_step | (ALL_XRAY_ATTACK_BLACK_PAWN[square] & occupied_square);
+    }
+  return one_step | (ALL_XRAY_ATTACK_BLACK_PAWN[square] & occupied_square);
+}
+
+bboard
+xray_attack_white_pawn (int square)
+{
+  return ALL_XRAY_ATTACK_WHITE_PAWN[square];
+}
+
+bboard
+xray_attack_black_pawn (int square)
+{
+  return ALL_XRAY_ATTACK_BLACK_PAWN[square];
+}
+
+bboard
+xray_rook (bboard occupied_square, int square)
+{
+  int i, dir;
+  bboard xray[4];
+  bboard collision, shielded_square;
+  for (i = 0, dir = 0; i < 4; i++, dir+=2)
+    {
+      xray[i] = sliding_attacks (1ULL << square, FULL_BOARD, dir);
+      collision = xray[i] & occupied_square;
+      shielded_square = sliding_attacks (collision, FULL_BOARD, dir);
+      xray[i] ^= shielded_square;
+    }
+  return xray[0] | xray[1] | xray[2] | xray[3];
+}
+
+bboard
+xray_knight (int square)
+{
+  return ALL_XRAY_KNIGHT[square];
+}
+
+bboard
+xray_bishop (bboard occupied_square, int square)
+{
+  int i, dir;
+  bboard xray[4];
+  bboard collision, shielded_square;
+  for (i = 0, dir = 1; i < 4; i++, dir+=2)
+    {
+      xray[i] = sliding_attacks (1ULL << square, FULL_BOARD, dir);
+      collision = xray[i] & occupied_square;
+      shielded_square = sliding_attacks (collision, FULL_BOARD, dir);
+      xray[i] ^= shielded_square;
+    }
+  return xray[0] | xray[1] | xray[2] | xray[3];
+}
+
+bboard
+xray_queen (bboard occupied_square, int square)
+{
+  return xray_rook (occupied_square, square) | xray_bishop (occupied_square, square);
+}
+
+bboard
+xray_king (int square)
+{
+  return ALL_XRAY_KING[square];
+}