Ruby中的迷宫生成

时间:2012-10-14 22:15:55

标签: ruby algorithm maze

在看到这篇关于制作perfect maze generation (tile based version) in PHP的旧文章后,我试图将原始的PHP代码翻译成Ruby。经过几次尝试,我看不出我在哪里弄错了。

这是我的Ruby代码:

maze_width = 9
maze_height = 7
moves = []
width = 2*maze_width +1
height = 2*maze_height +1
maze = Hash.new{|h, k| h[k] = []}

for x in 0..height-1
    for y in 0..width-1
        maze[x][y] = 1
    end
end

x_pos = 1
y_pos = 1
maze[x_pos][y_pos] = 0
moves.push(y_pos + (x_pos * width))
while(!moves.empty?)
    possible_directions = ""
    # puts "x_pos: #{x_pos} y_pos: #{y_pos}"
    if(maze[x_pos+2][y_pos]== 1 and x_pos+2!=0 and x_pos+2!=height-1)
        possible_directions += "S"
    end
    if(maze[x_pos-2][y_pos]== 1 and x_pos-2!=0 and x_pos-2!=height-1)
        possible_directions += "N"
    end
    if(maze[x_pos][y_pos-2]== 1 and y_pos-2!=0 and y_pos-2!=width-1)
        possible_directions += "W"
    end
    if(maze[x_pos][y_pos+2]== 1 and y_pos+2!=0 and y_pos+2!=width-1)
        possible_directions += "E"
    end
    if(!possible_directions.empty?)
        move = rand(possible_directions.length)
        case(possible_directions[move].chr)
            when "N":
                maze[x_pos-2][y_pos] = 0;
                maze[x_pos-1][y_pos] = 0;
                x_pos -= 2;
            when "S":
                maze[x_pos+2][y_pos] = 0;
                maze[x_pos+1][y_pos] = 0;
                x_pos += 2;
            when "W":
                maze[x_pos][y_pos-2] = 0;
                maze[x_pos][y_pos-1] = 0;
                y_pos -= 2;
            when "E":
                maze[x_pos][y_pos+2] = 0;
                maze[x_pos][y_pos+1] = 0;
                y_pos += 2;
        end
        moves.push(y_pos+(x_pos*width))

    else 
        back = moves.pop
        x_pos = (back/width).floor
        y_pos = back%width
    end
end
# draw the maze

for x in 0..height-1
    for y in 0..width-1
        print((maze[x][y] == 1) ? "#" : " ")
    end
    puts
end

如果我执行它,它会显示一个丑陋且不完美的迷宫:

###################
# #               #
#    #         #   
#                  
##       #   #     
#     #         #  
#          # #     
        #          
#              #   
  #       #        
##       #   #     
    # #     #      
#        #         
              #    
###################

这与PHP输出完全不同:

###################
#   # #           #
### # # ##### ### #
# # # #   # #   # #
# # # ### # ### ###
# # #   #     #   #
# # ### ##### ### #
# #   #         # #
# ### ########### #
# #   #         # #
# # ### ####### # #
# #     #   #   # #
# ####### # # ### #
#         #       #
###################

1 个答案:

答案 0 :(得分:2)

在语言之间翻译代码时,要注意挑剔的语义差异。在这里咬你的是Ruby中的负索引从数组的末尾开始计数,而不是返回null。迷宫代码没有任何范围检查,以查看x_posy_pos是否正在移出数组的末尾;如果要求不存在的元素,它只依赖于返回null的数组。最终结果是你允许从左侧和顶部移动并获得无意义的结果。   如果随机发生器正确点击,你也会从右下角获得零例外,所以你也要检查它们。

因此,在四个方向检查中,添加一些范围代码。例如,转过来:

if(maze[x_pos+2][y_pos]== 1 and x_pos+2!=0 and x_pos+2!=height-1)
    possible_directions += "S"
end
if(maze[x_pos-2][y_pos]== 1 and x_pos-2!=0 and x_pos-2!=height-1)
    possible_directions += "N"
end

进入这个:

if(x_pos+2 < height and maze[x_pos+2][y_pos]== 1 and x_pos+2!=0 and x_pos+2!=height-1)
    possible_directions += "S"
end
if(x_pos-2 > 0 and maze[x_pos-2][y_pos]== 1 and x_pos-2!=0 and x_pos-2!=height-1)
    possible_directions += "N"
end

同样适用于y_poswidth