khetai 0.2.1 → 0.2.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 1883bbf3758483b6771f1fce6c7ff1c9bc6625a88035ca57f71efb7e03b25e9d
-  data.tar.gz: 62a0eb4c822754885c6e92d4ad07a78301e6d566b2f804e4fb03db31f4192a6a
+  metadata.gz: 152a53d7588c5ecc8b763bf457852092ddebc3b10b2de158aa25695b1ce8436e
+  data.tar.gz: 59de4c1797063aa6d952cdc3c954b093e63a5ad874c605d891532da32fb7cd77
 SHA512:
-  metadata.gz: bcd3d8db78079c7373a228f53408444341d43f5abbc96402d5775cd3f379554b3790152bd7dc1d17604d956dcf2d07329149098a89f6d54df94222f4a6b6c637
-  data.tar.gz: c1e1ca8ce28b5e690720de15a32af6938970ad6b86fa759bd8cee1f101f8d607642f0d05b6861f8507794e3950e69a03cd76797121d3038ec19193fda36ba6cf
+  metadata.gz: a59d6d2ee6d67b3938e9fe2caa8270094dbd88f2a36efbef9c70824da7684b61baca3b64ece435d659b2c83e54940c644b67acfd1efbcbdfef2a0d32355a36c1
+  data.tar.gz: b92b7efea628fc6cc072b9ff74dfd3a9156c6ef1a9bec5fcc1e86d801254e1fd445d914f00c43399afa3b1ab4e3190dd435703c7798e811ad3645831cc06f059

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    khetai (0.2.1)
+    khetai (0.2.2)
 
 GEM
   remote: https://rubygems.org/

data/README.md

@@ -51,6 +51,7 @@ The internals of the gem are written in C, located in `ext/khetai`.
     $ bundle exec rake build
     $ gem install pkg/khetai-<version>.gem
 
+Once tested and verified, bump the version number in `lib/khetai/version.rb`
 
 To release and push to rubygems.org:
 
@@ -63,4 +64,4 @@ There is a GUI test harness written in C++ using FLTK available in the `ext/khet
 
 ### Why does this exist?
 
-To learn, build, and have fun.
+As something to work on and learn from.

data/ext/khetai/khetai.c

@@ -40,7 +40,7 @@ VALUE move(VALUE self, VALUE board_array, VALUE _player, VALUE _max_depth, VALUE
         VALUE element = rb_ary_entry(board_array, i);
         if (!RB_TYPE_P(element, T_STRING) || RSTRING_LEN(element) != 2)
         {
-            rb_raise(rb_eArgError, "each element in the board_array must be 2 characters");
+            rb_raise(rb_eArgError, "each element in board_array must be 2 characters");
         }
 
         // check if element in board_array is a valid string
@@ -56,7 +56,7 @@ VALUE move(VALUE self, VALUE board_array, VALUE _player, VALUE _max_depth, VALUE
         }
         if (!is_valid)
         {
-            rb_raise(rb_eArgError, "each element in the board_array must be a valid piece (example: 'p1') or empty ('--')");
+            rb_raise(rb_eArgError, "each element in board_array must be a valid piece (example: 'p1') or empty ('--')");
         }
     }
 

data/ext/khetai/khetai_lib.c

@@ -11,6 +11,7 @@ Square board[120] = {0};
 int pharaoh_loc[2] = {0};
 enum Player whose_turn;
 enum Player starter;
+int initial_depth = 0;
 
 Move undo_moves[MAX_DEPTH] = {0};
 int undo_capture_indices[MAX_DEPTH] = {0};
@@ -29,6 +30,7 @@ Move alphabeta_root(int depth, enum Player player)
 {
     whose_turn = player;
     starter = player;
+    initial_depth = depth;
     int best_score = -MAX_SCORE;
     Move best_move = (Move)0;
     int alpha = -MAX_SCORE;
@@ -71,8 +73,10 @@ int alphabeta(int depth, enum Player player, int alpha, int beta)
     int alpha_orig = alpha;
     Move valid_moves[NUM_VALID_MOVES] = {0};
     int vi = 0;
+
+    int table_depth = initial_depth - depth;
     HashEntry *entry = search_table(hashes[move_num]);
-    if (entry->key == hashes[move_num] && entry->depth >= depth)
+    if (entry->key == hashes[move_num] && entry->depth > table_depth)
     {
         if (entry->flag == EXACT)
             return entry->score;
@@ -123,19 +127,19 @@ int alphabeta(int depth, enum Player player, int alpha, int beta)
     else if (best_score >= beta)
         flag = ALPHA;
 
-    insert_table(hashes[move_num], depth, flag, best_score, best_move);
+    
+    insert_table(entry, hashes[move_num], table_depth, flag, best_score, best_move);
     return best_score;
 }
 
-void insert_table(uint64_t key, int depth, int flag, int score, Move move)
+void insert_table(HashEntry *entry, uint64_t key, int table_depth, int flag, int score, Move move)
 {
-    HashEntry *entry = search_table(key);
     if (entry->key != 0)
     {
-        if (depth < entry->depth)
+        if (table_depth > entry->depth)
         {
             entry->key = key;
-            entry->depth = depth;
+            entry->depth = table_depth;
             entry->flag = flag;
             entry->score = score;
             entry->move = move;
@@ -144,7 +148,7 @@ void insert_table(uint64_t key, int depth, int flag, int score, Move move)
     else
     {
         entry->key = key;
-        entry->depth = depth;
+        entry->depth = table_depth;
         entry->flag = flag;
         entry->score = score;
         entry->move = move;
@@ -154,7 +158,7 @@ void insert_table(uint64_t key, int depth, int flag, int score, Move move)
 int calculate_score()
 {
     int score = 0;
-    int anubis_score = 500;
+    int anubis_score = 800;
     int pyramid_score = 1000;
     int pharaoh_score = 100000;
     for (int i = 0; i < 120; i++)

data/ext/khetai/khetai_lib.h

@@ -38,6 +38,7 @@ enum Orientation
 
 extern enum Player whose_turn;
 extern enum Player starter;
+extern int initial_depth;
 
 // north, east, south, west, diagonals
 static const int directions[8] = {-12, 1, 12, -1, (12 + 1), (12 - 1), (-12 + 1), (-12 - 1)};
@@ -223,6 +224,6 @@ typedef struct HashEntry
 
 extern HashEntry table[TABLE_SIZE];
 static inline HashEntry *search_table(uint64_t key) { return &table[key % TABLE_SIZE]; };
-void insert_table(uint64_t key, int depth, int flag, int score, Move move);
+void insert_table(HashEntry *entry, uint64_t key, int depth, int flag, int score, Move move);
 
 #endif // KHET_LIB_H_INCLUDED

data/lib/khetai/version.rb

@@ -1,3 +1,3 @@
 module KhetAI
-  VERSION = "0.2.1"
+  VERSION = "0.2.2"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: khetai
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.2.2
 platform: ruby
 authors:
 - jkugs
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2024-10-17 00:00:00.000000000 Z
+date: 2024-11-03 00:00:00.000000000 Z
 dependencies: []
 description: 
 email: