File	Date	Author	Commit
src	2010-11-29	xxxhunterxxx	[f016b1] Version 1.0
BraVe.png	2010-11-29	xxxhunterxxx	[f016b1] Version 1.0
Makefile	2010-11-29	xxxhunterxxx	[f016b1] Version 1.0
README	2010-11-27	xxxhunterxxx	[934b92] Benchmarks added; initial direction choosing
robot.c	2010-11-29	xxxhunterxxx	[f016b1] Version 1.0
test.map	2010-11-22	xxxhunterxxx	[73eae9] Bug in map imports fixed + crashed bot picture

Read Me

BRAintenberg VEhicles simulation program
————————————————————————————————————————

Brave is a program which allows you to test the efficiency of a given exploration algorithm in a text-graphical environment. The rules are very simple :

	o There is a map with a single robot on it
	o The robot has 8 captors, that is one for each direction around it (North, South, East, West plus the diagonals)
	o You may write your program in the text file «robot.c». Further instruction awaits you there.
	o When you're done, you should issue «make» on the command line in brave's directory (that is, the one containing this README if nothing's been changed). Each time robot.c is changed, you need to recompile brave (but it's very quick).
	o If successful, you can then call brave (typing «./brave somemapfile» in the command line, where of course you replace somemapfile by the name of the map you've written)
	o You can write any map file to test your robot in. The exemple test.map can be used to check everything works as expected.
	o Make sure when you write a map that every line has the same length. Appart from that, you're quite free : you can use any ASCII character you like, spaces are for free cases, «o» characterfor the default position of the robot in this map, anything else will be considered an obstacle by the robot.
	o There is a «benchmark» mode, which allows you to test the efficiency of a given behaviour for a map, testing all available start position on this map, and returning the average values.