takuma-saito/q-puzzle.rb

## q-puzzle.rb
# 9 パズルビームサーチの擬似コード

queue.push({s: {7, 8, 0, 1, 2, 3, 4, 5, 6}, r: 2})
while (not queue.empty())
  pqueue = PriorityQueue.new
  while (q = queue.pop())
  	[[-1, 0], [0, 1], [1, 0], [0, -1]].each do |d|
      newState = state(q, d)
      pqueue.push(newState)
      pqueue.pop() if pqueue.size > K
    end
  end
  while (q = pqueue.pop())
    queue.push(q) # 逆順にしておく
  end
end
	# 9 パズルビームサーチの擬似コード

	queue.push({s: {7, 8, 0, 1, 2, 3, 4, 5, 6}, r: 2})
	while (not queue.empty())
	pqueue = PriorityQueue.new
	while (q = queue.pop())
	[[-1, 0], [0, 1], [1, 0], [0, -1]].each do \|d\|
	newState = state(q, d)
	pqueue.push(newState)
	pqueue.pop() if pqueue.size > K
	end
	end
	while (q = pqueue.pop())
	queue.push(q) # 逆順にしておく
	end
	end