monty_hall_problem 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 6f60ba7f7ad7fa47cdbe018339b9b5a646ea3c3eb0c55dc22f6a111e83e8c058
+  data.tar.gz: 4fd644683723c099f39d59a486566ced64f3a1846496cfee08d8424015e6c14b
+SHA512:
+  metadata.gz: 31e23af302ceff776890ca5280e9bc036ba0423e6beffba26986bb832045cac01eec7c247f6333c8e6a32e7709cacaf08c44e74148ce74a42e559ffed62ea1c4
+  data.tar.gz: c94ef33e5c181e7148d0222ce0035899ce836f0b4e1481e34758a8edc34b817c80defcd3e8f4437866235cdd83eef8524cf00d595614aef5609e1a48d6469676

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,8 @@
+AllCops:
+  TargetRubyVersion: 3.0
+
+Style/StringLiterals:
+  EnforcedStyle: double_quotes
+
+Style/StringLiteralsInInterpolation:
+  EnforcedStyle: double_quotes

data/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024 xb
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/README.md

@@ -0,0 +1,17 @@
+# MontyHallProblem
+
+Simulate the [Monty Hall Problem](https://en.wikipedia.org/wiki/Monty_Hall_problem)
+
+## Usage
+
+```ruby
+require 'monty_hall_problem'
+
+MontyHallProblem::Playground.new(100).play(:change).play(:no_change)
+# change - all:100; win:69; lose:31; P(win)=69.0%
+# no_change - all:100; win:34; lose:66; P(win)=34.0%
+
+MontyHallProblem::Playground.new(100, door_size: 10, car_size: 1, open_size: 8).play(:change).play(:no_change)
+# change - all:100; win:91; lose:9; P(win)=91.0%
+# no_change - all:100; win:9; lose:91; P(win)=9.0%
+```

data/Rakefile

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+require "rubocop/rake_task"
+
+RuboCop::RakeTask.new
+
+task default: %i[spec rubocop]

data/lib/monty_hall_problem/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module MontyHallProblem
+  VERSION = "0.1.0"
+end

data/lib/monty_hall_problem.rb

@@ -0,0 +1,119 @@
+# frozen_string_literal: true
+
+require_relative "monty_hall_problem/version"
+
+module MontyHallProblem
+  class Error < StandardError; end
+  class Host
+    def initialize(doors, car_size=1)
+      @doors = doors
+      @car_size = car_size
+    end
+
+    def put_cars
+      @car_size.times do
+        loop do
+          break if @doors.put(rand(@doors.size))
+        end
+      end
+    end
+
+    def open_wronth_door(idx, open_size = 1)
+      idxs = (@doors.no_car_door_idx - Array(idx)).sample(open_size)
+      @doors.opened_door_idx += idxs unless idxs.empty?
+      idxs
+    end
+
+    def make_known(idx)
+      @doors.door[idx]
+    end
+  end
+
+  class Player
+    def initialize(doors)
+      @doors = doors
+    end
+
+    def choose_door
+      rand(@doors.size)
+    end
+
+    def change_door(choosed_door_idx)
+      (Array.new(@doors.size) { |i| i } - (@doors.opened_door_idx + Array(choosed_door_idx))).sample || choosed_door_idx
+    end
+  end
+
+  class Doors
+    attr_accessor :size
+    attr_accessor :door
+    attr_accessor :opened_door_idx
+
+    def initialize(size=3)
+      self.size = size
+      self.door = Array.new(size) { false }
+      self.opened_door_idx = []
+    end
+
+    def put(door_idx)
+      if door[door_idx]
+        return false
+      else
+        door[door_idx] = true
+        return true
+      end
+    end
+
+    def car_door_idx
+      door.map.with_index{ |e, i| i if !!e  }.compact
+    end
+
+    def no_car_door_idx
+      door.map.with_index{ |e, i| i if !e  }.compact
+    end
+  end
+
+  class Playground
+    attr_accessor :times
+
+    def initialize(times, door_size: 3, car_size: 1, open_size: 1)
+      self.times = times
+      @door_size = door_size
+      @car_size = car_size
+      @open_size = open_size
+    end
+
+    def play_change
+      doors = Doors.new(@door_size)
+      host = Host.new(doors, @car_size)
+      player = Player.new(doors)
+
+      host.put_cars
+      idx = player.choose_door
+      host.open_wronth_door(idx, @open_size)
+      idx = player.change_door(idx)
+      host.make_known(idx) ? :win : :lose
+    end
+
+    def play_no_change
+      doors = Doors.new(@door_size)
+      host = Host.new(doors, @car_size)
+      player = Player.new(doors)
+
+      host.put_cars
+      idx = player.choose_door
+      host.open_wronth_door(idx, @open_size)
+      host.make_known(idx) ? :win : :lose
+    end
+
+    def play(mode)
+      result = self.times.times.map do
+        mode == :change ? play_change : play_no_change
+      end
+
+      win_count = result.count { |e| e == :win }
+      lose_count = result.count { |e| e == :lose }
+      puts "#{mode} - all:#{self.times}; win:#{win_count}; lose:#{lose_count}; P(win)=#{(win_count.to_f/self.times.to_f * 100).round(2)}%"
+      self
+    end
+  end
+end

data/sig/monty_hall_problem.rbs

@@ -0,0 +1,4 @@
+module MontyHallProblem
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,54 @@
+--- !ruby/object:Gem::Specification
+name: monty_hall_problem
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- XB
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2024-12-20 00:00:00.000000000 Z
+dependencies: []
+description: https://en.wikipedia.org/wiki/Monty_Hall_problem
+email:
+- hsw840139210@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".rspec"
+- ".rubocop.yml"
+- LICENSE
+- README.md
+- Rakefile
+- lib/monty_hall_problem.rb
+- lib/monty_hall_problem/version.rb
+- sig/monty_hall_problem.rbs
+homepage: https://github.com/doraemon0711/monty_hall_problem
+licenses: []
+metadata:
+  allowed_push_host: https://rubygems.org/
+  homepage_uri: https://github.com/doraemon0711/monty_hall_problem
+  source_code_uri: https://github.com/doraemon0711/monty_hall_problem
+  changelog_uri: https://github.com/doraemon0711/monty_hall_problem
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 3.0.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.5.4
+signing_key: 
+specification_version: 4
+summary: Simulate the Monty Hall Problem
+test_files: []