Unit Tests for parsing iiLang Percepts (and Iilang Elements). unit test for perceptCollection not written. All tests pass
Started working on agent AI.
Added seperate files for agents.
Moved type declarations from AgentLogic to AgentTypes.
Merge branch 'AgentLogicAI' of https://github.com/jannickj/nabf into IiLangFsharp

Conflicts:
	TeamNabf/NabfAgentLogic/AgentLogic.fs
	TeamNabf/NabfAgentLogic/AgentLogicClient.fs
	TeamNabf/NabfAgentLogic/Graph.fsi
	TeamNabf/NabfAgentLogic/NabfAgentLogic.fsproj
Merge branch 'AgentLogic' of https://github.com/jannickj/nabf into AgentLogicAI

Conflicts:
	TeamNabf/NabfAgentLogic/AgentLogic.fs
	TeamNabf/NabfAgentLogic/AgentLogicClient.fs
	TeamNabf/NabfAgentLogic/Graph.fsi
	TeamNabf/NabfAgentLogic/NabfAgentLogic.fsproj
Fixed build errors from merge
Added actions for individual agent types
Merge branch 'AgentLogicAI' of https://github.com/jannickj/nabf into AgentLogicAI
Fixed Søren's crappy douchebaggery. Don't touch my files again Søren!
Merge branch 'AgentLogicAI' of https://github.com/jannickj/nabf into IiLangFsharp

Conflicts:
	TeamNabf/NabfAgentLogic/AgentLogic.fs
	TeamNabf/NabfAgentLogic/AgentLogicClient.fs
	TeamNabf/NabfAgentLogic/Graph.fsi
	TeamNabf/NabfAgentLogic/NabfAgentLogic.fsproj
indent of string
Implemented decision in AgentLogic
* Implemented parsing percepts defined so far (Untested)
* Introduced namespace “Graphing”, which contains “Graph” and “Dijkstra” modules so far
* Removed “Position” from AgentTypes.Agent, as we already have “Node”
Moved IiLang-files to subfolder “IiLang”. Parsing and building should be in seperate files
Merge branch 'IiLangFsharp' into Dijkstra

Conflicts:
	TeamNabf/NabfAgentLogic/AgentTypes.fs
Started on basic behavioral logic.
Merge branch 'AgentLogicAI' into Dijkstra

Conflicts:
	TeamNabf/NabfAgentLogic/AgentLogic.fs
	TeamNabf/NabfAgentLogic/Graph.fs
	TeamNabf/NabfAgentLogic/Inspector.fs
	TeamNabf/NabfAgentLogic/NabfAgentLogic.fsproj
	TeamNabf/NabfAgentLogic/Repairer.fs
	TeamNabf/NabfAgentLogic/Saboteur.fs
Fixed misc. build errors
Fixed folders
Implemented example accumulative path cost (to be moved out of Dijkstra.fs
* Dijkstra now takes a generic “Problem” type, which contains
	* a function to check whether a given vertex is the goal vertex
	* a function to compute a new cost given a previous cost and an edge cost
	* an initial cost
  This allows us to use generic costs, like the one currently used by the agents ( which is based on energy and turns spent)
* Provided wrappers for Dijkstra in PathFinding module, along with an implementation of a path cost