| 赞 | 13 |
| VIP | |
| 好人卡 | |
| 积分 | 28 |
| 经验 | |
| 最后登录 | 2026-2-19 |
| 在线时间 | 2634 小时 |
- 梦石
- 0
- 星屑
- 2826
- 在线时间
- 2634 小时
- 注册时间
- 2013-1-16
- 回帖
- 5453

|
加入我们,或者,欢迎回来。
您需要 登录 才可以下载或查看,没有账号?注册会员
×
本帖最后由 myownroc 于 2014-8-5 17:01 编辑
旧版本用法:在事件页中使用脚本,输入以下内容。
- f = BFS.new
- f.find_path(character, tx, ty)
复制代码
说明:
如果想要移动主角,character为$game_player;若想移动事件,character为$game_map.events[n] (注:n为相应事件的ID)
注意:该脚本适用于较小的地图(推荐不超过50*50)且工程的系统应基于默认的RGSS。
- # This algorithm is based on Breadth-First-Search.
- # Due to BFS algorithm, we suggest your map's area be below 50*50.
- # In a word, this algorithm is suitable for small map.
- # If you want to use this method, please write following codes
- # in the events pages:
- #
- # f = BFS.new
- # f.find_way(character, target_x, target_y)
- #
- # If you want to move your own player, 'character' would be '$game_player'
- # If you want to move a event(ID :n), 'character' would be '$game_map.events[n]'
- # Once you finish what we had said above, the selected character would move to
- # the target point.
- class BFS
- def find_path(character, target_x, target_y)
- origin_x, origin_y = character.x, character.y
- # exit when it's out of map
- return if ((target_x > $game_map.width - 1) ||
- (target_y > $game_map.height - 1))
- # exit when it is not accessable
- return if (!$game_map.passable?(target_x, target_y, 0, character))
- # exit when target is where character is.
- return if (target_x == character.x and target_y == character.y)
- # find the path
- openlist = []
- closelist = []
- father = []
- for i in 0...$game_map.width
- father << []
- for j in 0...$game_map.height
- father[-1] << nil
- end
- end
- path = []
- found = false
- openlist << [character.x, character.y]
- while !openlist.empty? and !found
- openlist.each{|e|
- # delete & move
- openlist.delete(e)
- closelist << e
- # down
- if $game_map.passable?(e[0], e[1] + 1, 2, character) &&
- !closelist.include?([e[0], e[1] + 1]) &&
- !openlist.include?([e[0], e[1] + 1])
- openlist << [e[0], e[1] + 1] if !openlist.include?([e[0], e[1] + 1])
- father[e[0]][e[1] + 1] = [e[0], e[1]] if !closelist.include?([e[0], e[1] + 1])
- end
- # left
- if $game_map.passable?(e[0] - 1, e[1], 4, character) &&
- !closelist.include?([e[0] - 1, e[1]]) &&
- !openlist.include?([e[0] - 1, e[1]])
- openlist << [e[0] - 1, e[1]] if !openlist.include?([e[0] - 1, e[1]])
- father[e[0] - 1][e[1]] = [e[0], e[1]] if !closelist.include?([e[0] - 1, e[1]])
- end
- # up
- if $game_map.passable?(e[0], e[1] - 1, 8, character) &&
- !closelist.include?([e[0], e[1] - 1]) &&
- !openlist.include?([e[0], e[1] - 1])
- openlist << [e[0], e[1] - 1] if !openlist.include?([e[0], e[1] - 1])
- father[e[0]][e[1] - 1] = [e[0], e[1]] if !closelist.include?([e[0], e[1] - 1])
- end
- # right
- if $game_map.passable?(e[0] + 1, e[1], 6, character) &&
- !closelist.include?([e[0] + 1, e[1]]) &&
- !openlist.include?([e[0] + 1, e[1]])
- openlist << [e[0] + 1, e[1]] if !openlist.include?([e[0] + 1, e[1]])
- father[e[0] + 1][e[1]] = [e[0], e[1]] if !closelist.include?([e[0] + 1, e[1]])
- end
- # get target?
- if openlist.include?([target_x, target_y])
- found = true
- break
- end
- }
- end
- # exit when we can't find a path
- return if !found
- # create move command & carry out
- if found
- x, y = target_x, target_y
- while [x, y] != [origin_x, origin_y]
- dx, dy = father[x][y][0] - x, father[x][y][1] - y
- step = 2 if dy == -1
- step = 4 if dx == 1
- step = 8 if dy == 1
- step = 6 if dx == -1
- path << step
- x, y = father[x][y][0], father[x][y][1]
- end
- path.reverse!
- end
- list = []
- path.each{|e|
- code = 1 if e == 2
- code = 2 if e == 4
- code = 4 if e == 8
- code = 3 if e == 6
- list << RPG::MoveCommand.new(code)
- }
- list << RPG::MoveCommand.new(0)
- skippable = false
- repeat = false
- commands = RPG::MoveRoute.new
- commands.skippable = skippable
- commands.repeat = repeat
- commands.list = list
- # move
- if character == nil
- # continue
- return true
- end
- # force_move
- character.force_move_route(commands)
- # continue
- return true
- end
- end
复制代码- class BFS
- def find_path(character, tx, ty)
- ox, oy = character.x, character.y
- return if (tx >$game_map.width - 1) || (ty > $game_map.height - 1)
- return if !($game_map.passable?(tx, ty, 0, character))
- return if (tx == ox) && (ty == oy)
- checked = []
- father = []
- for i in 0...$game_map.width
- checked << []
- father << []
- for j in 0...$game_map.height
- checked[-1] << 0
- father[-1] << nil
- end
- end
- path = []
- found = false
- checked[ox][oy] = 1
- empty = false
- loop do
- empty = true
- for i in 0...$game_map.width
- for j in 0...$game_map.height
- if checked[i][j] == 1
- checked[i][j] = 2
- if $game_map.passable?(i, j + 1, 2, character) &&
- checked[i][j + 1] == 0
- checked[i][j + 1] = 1
- father[i][j + 1] = [i, j]
- end
- if $game_map.passable?(i - 1, j, 4, character) &&
- checked[i - 1][j] == 0
- checked[i - 1][j] = 1
- father[i - 1][j] = [i, j]
- end
- if $game_map.passable?(i, j - 1, 8, character) &&
- checked[i][j - 1] == 0
- checked[i][j - 1] = 1
- father[i][j - 1] = [i, j]
- end
- if $game_map.passable?(i + 1, j, 6, character) &&
- checked[i + 1][j] == 0
- checked[i + 1][j] = 1
- father[i + 1][j] = [i, j]
- end
- end
- if checked[tx][ty] == 1
- found = true
- break
- end
- end
- end
- for i in 0...$game_map.width
- empty = false if checked[i].include?(1)
- end
- if found || empty
- break
- end
- end
- return if !found
- if found
- x, y = tx, ty
- while [x, y] != [ox, oy]
- dx, dy = father[x][y][0] - x, father[x][y][1] - y
- step = 2 if dy == -1
- step = 4 if dx == 1
- step = 8 if dy == 1
- step = 6 if dx == -1
- path << step
- x, y = father[x][y][0], father[x][y][1]
- end
- path.reverse!
- end
- list = []
- path.each{|e|
- code = 1 if e == 2
- code = 2 if e == 4
- code = 4 if e == 8
- code = 3 if e == 6
- list << RPG::MoveCommand.new(code)
- }
- list << RPG::MoveCommand.new(0)
- skippable = false
- repeat = false
- commands = RPG::MoveRoute.new
- commands.skippable = skippable
- commands.repeat = repeat
- commands.list = list
- if character == nil
- return true
- end
- character.force_move_route(commands)
- return true
- end
- end
复制代码
以下为最新版本
用法:在事件页中使用脚本,输入以下内容。
- BFS.find_path(character, target_x, target_y)
复制代码
说明:
如果想要移动主角,character为$game_player;若想移动事件,character为$game_map.events[n] (注:n为相应事件的ID)
注意:该脚本适用于较小的地图(推荐不超过100*100)且工程的系统应基于默认的RGSS。
- module BFS
- def self.find_path(character, tx, ty)
- ox, oy = character.x, character.y
- return if (tx > $game_map.width - 1) || (ty > $game_map.height - 1)
- return if !($game_map.passable?(tx, ty, 0, character))
- return if (tx == ox) && (ty == oy)
- checked = []
- father = []
- for i in 0...$game_map.width
- checked << []
- father << []
- for j in 0...$game_map.height
- checked[-1] << 0
- father[-1] << nil
- end
- end
- path = []
- found = false
- checked[ox][oy] = 1
- empty = false
- loop do
- empty = true
- for i in 0...$game_map.width
- for j in 0...$game_map.height
- if checked[i][j] == 1
- checked[i][j] = 2
- if $game_map.passable?(i, j + 1, 2, character) &&
- checked[i][j + 1] == 0
- checked[i][j + 1] = 1
- father[i][j + 1] = [i, j]
- end
- if $game_map.passable?(i - 1, j, 4, character) &&
- checked[i - 1][j] == 0
- checked[i - 1][j] = 1
- father[i - 1][j] = [i, j]
- end
- if $game_map.passable?(i, j - 1, 8, character) &&
- checked[i][j - 1] == 0
- checked[i][j - 1] = 1
- father[i][j - 1] = [i, j]
- end
- if $game_map.passable?(i + 1, j, 6, character) &&
- checked[i + 1][j] == 0
- checked[i + 1][j] = 1
- father[i + 1][j] = [i, j]
- end
- end
- if checked[tx][ty] == 1
- found = true
- break
- end
- end
- end
- for i in 0...$game_map.width
- empty = false if checked[i].include?(1)
- end
- if found || empty
- break
- end
- end
- return if !found
- if found
- x, y = tx, ty
- while [x, y] != [ox, oy]
- dx, dy = father[x][y][0] - x, father[x][y][1] - y
- step = 2 if dy == -1
- step = 4 if dx == 1
- step = 8 if dy == 1
- step = 6 if dx == -1
- path << step
- x, y = father[x][y][0], father[x][y][1]
- end
- path.reverse!
- end
- list = []
- path.each{|e|
- code = 1 if e == 2
- code = 2 if e == 4
- code = 4 if e == 8
- code = 3 if e == 6
- list << RPG::MoveCommand.new(code)
- }
- list << RPG::MoveCommand.new(0)
- skippable = false
- repeat = false
- commands = RPG::MoveRoute.new
- commands.skippable = skippable
- commands.repeat = repeat
- commands.list = list
- if character == nil
- return true
- end
- character.force_move_route(commands)
- return true
- end
- end
复制代码
如果还不能理解以上所述,可以下载附件进行考察。
FindPath.rar
(192.79 KB, 下载次数: 389)
冲突评估(欢迎讨论):
双远景/三远景系统(预测,没有实验证据)
鼠标系统(预测,没有实验证据)
八方行走系统(预测,没有实验证据)
更新记录:
当前新版本比之前一个版本修正了绕路的bug。
提高了算法的效率。 |
评分
-
查看全部评分
|