ruin.nu Git - icfp05.git/search

]> ruin.nu Git - icfp05.git/search

2005-06-26	Michael Andreen	priority queue instead of a vector which is later sorted	commit \| commitdiff \| tree
2005-06-26	Michael Andreen	changed the shortest path algorithm to support reverse...	commit \| commitdiff \| tree
2005-06-26	Michael Andreen	sort the banks in the right order	commit \| commitdiff \| tree
2005-06-26	Michael Andreen	tuning and restructuring	commit \| commitdiff \| tree
2005-06-26	Michael Andreen	robber didn't know as much as I thought, avoid intersections...	commit \| commitdiff \| tree
2005-06-26	Michael Andreen	tuned robber a bit	commit \| commitdiff \| tree
2005-06-26	Michael Andreen	some restructuring	commit \| commitdiff \| tree
2005-06-25	Michael Andreen	bugfix	commit \| commitdiff \| tree
2005-06-25	Michael Andreen	reading evidence	commit \| commitdiff \| tree
2005-06-25	Michael Andreen	made the shortest path algorithm more modular and tuned...	commit \| commitdiff \| tree
2005-06-25	Michael Andreen	added initial cop class	commit \| commitdiff \| tree
2005-06-25	Michael Andreen	more sane shortest path implementation and more tuning...	commit \| commitdiff \| tree
2005-06-25	Michael Andreen	fixed priority queue and started to implement the robber...	commit \| commitdiff \| tree
2005-06-24	Michael Andreen	implemented shortest path	commit \| commitdiff \| tree
2005-06-24	Michael Andreen	initial commit	commit \| commitdiff \| tree
2005-06-24	Michael Andreen	base class got enough for robber implementation	commit \| commitdiff \| tree
2005-06-24	Michael Andreen	dirs for robber and cop	commit \| commitdiff \| tree
2005-06-24	Michael Andreen	moved abstract base class to it's own subdir	commit \| commitdiff \| tree
2005-06-24	Michael Andreen	initial commit	commit \| commitdiff \| tree
2005-06-24	Michael Andreen	initial commit	commit \| commitdiff \| tree

My entry for the icfp contest 2005

RSS Atom