4张扑克牌24点Ruby算法

4张任意的扑克牌,用+,-,*,/,(,) 计算总合等于24的方法。
缺点:没有过滤重复的算法,比如
24=(4+(10+(11-1)))和24=(4+(-1)+(10+11))原本是一样的。

#
# count 4 random numbers(1-13) to 24 by using +,-,*,/,(,)
#
#
require 'mathn'

beginTime = Time.now
$opers = ['+','-','*','/']

def count24(total,data,str)

lack = getSymmetry(str)
lackNum = lack.abs
count = 0

cmd = ""

if data.size>2
data_backup = data.clone
i = 0
data_backup.each{ |number|
data = data_backup.clone
data.delete_at(i)
i +=1
$opers.each{ |op|
if op=='+'
cmd = str+"(" + number.to_s + "+"
count24(total-number.to_i,data,cmd)
elsif op=='-'
cmd = str+"(-" + number.to_s + ")+"
count24(total+number.to_i,data,cmd)
elsif op=='*'
cmd = str+number.to_s + "*("
count24(total.to_f/number.to_i,data,cmd)
elsif op=='*'
cmd = str+"(1\/" + number.to_s + ")*("
count24(total*number.to_i,data,cmd)
end
}
}
elsif data.size==2
n1 = data.at(0).to_i
n2 = data.at(1).to_i
ok = false
if total==n1 + n2
cmd = str+"(" + n1.to_s + "+" + n2.to_s + ")"
ok = true
elsif total==n1*n2
cmd = str+n1.to_s + "*" + n2.to_s
ok = true
end

if !ok && n1>n2
if n1-n2 == total
cmd = str+"(" + n1.to_s + "-"+n2.to_s + ")"
ok = true
elsif n1.to_f/n2==total.to_f
cmd = str+n1.to_s+ "/"+n2.to_s
ok = true
end
elsif !ok
if n2-n1 == total
cmd = str+ "(" + n2.to_s + "-" + n1.to_s + ")"
ok = true
elsif n2.to_f/n1 ==total.to_f
cmd = str+n2.to_s+"/"+n1.to_s
ok = true
end
end
(if lack<0
lackNum.downto(1){cmd ="("+cmd}
elsif lack>0
lackNum.downto(1){cmd +=")"}
end
puts "24="+cmd) if ok
end
end

def getSymmetry(str)
n_left = 0
n_right=0
return 0 if str==nil || str.length==0
for i in 0...str.length
if str[i,1]=='('
n_left+=1
elsif str[i,1]==')'
n_right+=1
end
end
return n_left-n_right
end


data = Array.[]();


while data.length<4
rn = rand(13)
data << (rn==0?13:rn)
end


data.each{|i| print i,","}
print "\n"
puts "---------------------"
count24(24,data,"")

puts "---------------------"
puts " "+((Time.now.to_i-beginTime.to_i)/1000).to_s + " s"


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
扑克牌24点游戏算法Java的实现可以分为以下几个步骤: 1. 使用Random类生成四个范围为1~13的随机数代表四牌。 2. 在数组中存放这四个数的所有排列组合方式。 3. 利用穷举法列出四个数和运符号的所有组合方式。 4. 构造每种组合方式的计函数。 5. 利用while循环和for循环的嵌套使用求出所有能24点的计式。 具体实现可以参考以下代码: ```java import java.util.Random; public class TwentyFourPoints { public static void main(String[] args) { int[] nums = new int[4]; Random random = new Random(); for (int i = 0; i < 4; i++) { nums[i] = random.nextInt(13) + 1; } System.out.println("四牌为:" + nums[0] + " " + nums[1] + " " + nums[2] + " " + nums[3]); int[][] permutes = permute(nums); for (int i = 0; i < permutes.length; i++) { int[] p = permutes[i]; if (calculate(p[0], p[1], p[2], p[3])) { System.out.println("能够得到24点的表达式为:" + p[0] + " " + p[1] + " " + p[2] + " " + p[3]); } } } public static int[][] permute(int[] nums) { int[][] result = new int[24][4]; int index = 0; for (int i = 0; i < nums.length; i++) { for (int j = 0; j < nums.length; j++) { if (j != i) { for (int k = 0; k < nums.length; k++) { if (k != i && k != j) { int l = 6 - i - j - k; result[index++] = new int[]{nums[i], nums[j], nums[k], nums[l]}; } } } } } return result; } public static boolean calculate(int a, int b, int c, int d) { return calculate(a, b, c, d, 0, 0, 0, 0) == 24; } public static int calculate(int a, int b, int c, int d, int i, int j, int k, int l) { if (i == 3 && j == 3 && k == 3 && l == 3) { return a; } int result = 0; switch (i) { case 0: result = calculate(a + b, c, d, 0, i + 1, j, k, l); break; case 1: result = calculate(a - b, c, d, 0, i + 1, j, k, l); break; case 2: result = calculate(a * b, c, d, 0, i + 1, j, k, l); break; case 3: result = calculate(a / b, c, d, 0, i + 1, j, k, l); break; } switch (j) { case 0: result = calculate(result + c, 0, 0, 0, i, j + 1, k, l); break; case 1: result = calculate(result - c, 0, 0, 0, i, j + 1, k, l); break; case 2: result = calculate(result * c, 0, 0, 0, i, j + 1, k, l); break; case 3: result = calculate(result / c, 0, 0, 0, i, j + 1, k, l); break; } switch (k) { case 0: result = calculate(result + d, 0, 0, 0, i, j, k + 1, l); break; case 1: result = calculate(result - d, 0, 0, 0, i, j, k + 1, l); break; case 2: result = calculate(result * d, 0, 0, 0, i, j, k + 1, l); break; case 3: result = calculate(result / d, 0, 0, 0, i, j, k + 1, l); break; } return result; } } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值