minimax_rb 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 6c43294f8e68ea64e505c0a4dfdf451227cac4480b94831b78cfe06dd5a52220
+  data.tar.gz: f6c00414447d0423a5f2e599e3afa90159b5e4b122f1fa3a0fe686a836d63fa8
+SHA512:
+  metadata.gz: d86ac7a345b0cbc017b22660b8a0578468673575f03bceddec9b67edfb356c9645cd56f7f2a3b88bb10908056730df7c1cfcfc101369b9f706197b5204d61659
+  data.tar.gz: cbdb86033be52846bb8497f124bfb8805fbfba66d35af29c84e34ea5f9d39eeb517bd07f4253d8c0dc4d34bf8a4996abeb54f184474bea6ffc8bb5b00d28a33f

data/lib/minimax_rb.rb

@@ -0,0 +1,83 @@
+module MinimaxRB
+  def self.best_move args
+    minimax(args[:board], args[:marker], args[:opponent], args.fetch(:empty_marker, nil))
+  end
+
+  private
+  def self.minimax board, marker, opponent, empty_marker, depth=0, best_score={}
+    return 0 if draw?(board, marker, opponent, empty_marker)
+    return -1 if win?(board, marker, opponent)
+
+    available_moves(board, empty_marker).each do |move|
+      board[move] = marker
+      best_score[move] = -1 * minimax(board, opponent, marker, empty_marker, depth+1, {})
+      board[move] = empty_marker
+    end
+
+    depth == 0 ? max_move(best_score) : max_score(best_score)
+  end
+
+  def self.max_move best_score
+    best_score.max_by { |key, value| value }[0]
+  end
+
+  def self.max_score best_score
+    best_score.max_by { |key, value| value }[1]
+  end
+
+  def self.available_moves array, empty_marker
+    available_moves = []
+    array.each_with_index do |value, index|
+      if value == empty_marker
+        available_moves << index
+      end
+    end
+    available_moves
+  end
+
+  def self.marker_winning_combo? marker, board
+    board.uniq.length == 1 and board.include?(marker)
+  end
+
+  def self.marker_winner? marker, board
+    combos = [rows(board), columns(board), diagonals(board)]
+    combos.each do |combo|
+      combo.each { |line| return true if marker_winning_combo?(marker, line) }
+    end
+    false
+  end
+
+  def self.rows board
+    board.each_slice(grid_size(board)).to_a
+  end
+
+  def self.columns board
+    rows(board).transpose
+  end
+
+  def self.diagonals board
+    left_diag = []
+    right_diag = []
+    (0...grid_size(board)).each do |i|
+      left_diag.push(rows(board)[i][i])
+      right_diag.push(rows(board).reverse[i][i])
+    end
+    [left_diag, right_diag]
+  end
+
+  def self.grid_size board
+    Math.sqrt(board.length)
+  end
+
+  def self.draw? board, marker, opponent, empty_marker
+    board_full?(board, empty_marker) and not win?(board, marker, opponent)
+  end
+
+  def self.win? board, marker, opponent
+    marker_winner?(marker, board) or marker_winner?(opponent, board)
+  end
+
+  def self.board_full? board, empty_marker
+    not board.include?(empty_marker)
+  end
+end

metadata

@@ -0,0 +1,44 @@
+--- !ruby/object:Gem::Specification
+name: minimax_rb
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- Brian Sung
+- Angelica Gonzalez
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2019-10-07 00:00:00.000000000 Z
+dependencies: []
+description: First iteration of Minimax Ruby gem
+email: dev.junehoe@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/minimax_rb.rb
+homepage: https://rubygems.org/gems/minimax_rb
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.0.3
+signing_key: 
+specification_version: 4
+summary: Minimax for Ruby
+test_files: []