behaviortree 1.0 → 2.0

data/README

@@ -7,45 +7,6 @@ http://aigamedev.com/open/articles/bt-overview/
 http://aigamedev.com/open/articles/behavior-trees-part1/
 http://nakkaya.com/2010/06/29/alter-ego-a-reactive-ai-library/
 
-To try it out, 'gem install rbtree'
+To try it out, 'gem install behaviortree'
 
-The rest of this README will walk through an explanation of the examples in sample.rb. This explanation is taken from my own blog post at http://www.nearinfinity.com/blogs/andrew_wagner/behavior_trees_in_ruby.html.
-
-In my spare time, I fancy myself a fan of AI. Mostly, this means sitting around pondering, but with some spare time today, I put together an actual working (though simple) library. I thought I would share a little about it on here. The code can be found here.
-
-Behavior Trees are a way of representing an algorithm as nodes in a tree. The leaf nodes actually perform actions, and nodes higher up in the tree branch depending on the environment. They are often used to model behaviors for agents in first-person games. The idea is that algorithms become very modular and composable when modeled this way.
-
-I'm going to walk through the examples in 'sample.rb' in the code repository. These examples revolve around some very simple behaviors on a list. First, we'll define a couple of actions:
-
-
-action :pop do |e|
-  e.pop
-end
-
-action :empty do |e|
-  e.empty?
-end
-
-The syntax here is somewhat like rake. I played with a lot of different ideas for this, but this seemed to come out the most readable. We're creating two actions, pop, and empty. An action is a leaf node in a behavior tree, so it actually interacts with the environment. Thus, the actions take a block which takes the environment, e, and does something with it. These are the fundamental building blocks.
-
-Now let's define a sequence node. A sequence node is a non-leaf node, which tries each of its children, and fails if any of the children fail. Very simple. So let's define it:
-
-sequence :pop_twice,  [:pop, :pop]
-
-
-Simple idea, simple syntax! The name of this node is 'pop_twice', and it contains two children, both of which are leaf nodes, and which pop one element off of the list that we're interacting with. Since the first child will succeed (assuming the list is non-empty), the second will always run. 
-
-Next, let's do a selector node. A selector node is another type of non-leaf node, which tries each of its children, but returns true if any child node returns true (and then stops looking). You can see, it's sort of the opposite of a sequence in some ways. So, what might it look like? Well, it could look exactly the same as a sequence!
-
-select :pop_once, [:pop, :pop]
-
-This selector has the same children, but notice that the name is pop_once. This is because...drumroll please...it will only pop one item. When the first succeeds, which it will, it is satisfied, and returns true.
-
-Now, lets look at the last two together:
-
-select :make_empty, [:empty, :continue]
-sequence :continue, [:pop, :make_empty]
-
-This is the culmination of what this little library can do. Isn't it impressive!? Here, we have two nodes which are defined in terms of each other. make_empty first checks wither the list is empty. If so, then, since it's a selector, it's satisfied, and execution stops. If not, however, it hits the second node, which is continue. Continue pops an item off the stak, and then _recursively_ refers to make_empty. So, what's this going to do? It will keep popping items off the list, until it's empty. Very simple, but a very powerful idea. 
-
-And that's about it for now! Hopefully, I will soon add the ability to define custom decorators in the library. Until then, enjoy!
+As an example of how to use this library, I've written a solution to the beginning level of rubywarrior (http://github.com/ryanb/ruby-warrior). 

data/Rakefile

@@ -2,7 +2,7 @@ require 'rubygems'
 require 'rake'
 require 'echoe'
 
-Echoe.new('behaviortree', '1.0') do |p|
+Echoe.new('behaviortree', '2.0') do |p|
   p.description    = "behavior trees for ruby"
   p.url            = "http://github.com/arwagner/behaviortree"
   p.author         = "Andrew Wagner"

data/behaviortree.gemspec

@@ -2,11 +2,11 @@
 
 Gem::Specification.new do |s|
   s.name = %q{behaviortree}
-  s.version = "1.0"
+  s.version = "2.0"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 1.2") if s.respond_to? :required_rubygems_version=
   s.authors = ["Andrew Wagner"]
-  s.date = %q{2010-10-26}
+  s.date = %q{2010-10-31}
   s.description = %q{behavior trees for ruby}
   s.email = %q{wagner.andrew@gmail.com}
   s.extra_rdoc_files = ["README", "lib/behaviortree.rb", "lib/behaviortree/behaviortree.rb"]

data/lib/behaviortree.rb

@@ -1 +1,3 @@
-require File.dirname(__FILE__) + '\\behaviortree\\behaviortree.rb'
+Dir["#{File.dirname(__FILE__)}/behaviortree/**/*.rb"].each do |f|
+  require f
+end

data/lib/behaviortree/behaviortree.rb

@@ -1,43 +1,8 @@
-module BTree
-  @actions = {}
-
-  class << self
-    attr_reader :actions
-  end
-  
-  def action name, &block
-    a = lambda {|e| yield e}
-    BTree.actions[name] = a unless name.nil?
-    a
-  end
+require 'yaml'
 
-  def execute symbol, environment
-    lookup(symbol).call environment
-  end
-
-  def lookup symbol
-    BTree.actions[symbol]
-  end
-  
-  def sequence symbol, children
-    process_children symbol, children, lambda {|result| result}
-  end
-
-  def select symbol, children
-    process_children symbol, children, lambda {|result| !result }
-  end
-
-  private
-  def process_children symbol, children, post_process
-    action symbol do |e|
-      continue = true
-      children.each do |child|
-        next unless continue
-        continue = post_process.call(execute child, e)
-      end
-      continue
-    end
+module BTree
+  def self.load_file file_name
+    raw = YAML::load_file file_name
+    tree = BehaviorCreator.new(raw).create
   end
 end
-
-include BTree

metadata

@@ -3,9 +3,9 @@ name: behaviortree
 version: !ruby/object:Gem::Version 
   prerelease: false
   segments: 
-  - 1
+  - 2
   - 0
-  version: "1.0"
+  version: "2.0"
 platform: ruby
 authors: 
 - Andrew Wagner
@@ -13,7 +13,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-10-26 00:00:00 -04:00
+date: 2010-10-31 00:00:00 -04:00
 default_executable: 
 dependencies: []