aboutsummaryrefslogtreecommitdiff
path: root/problem.hpp
diff options
context:
space:
mode:
authorJean Fabre-Monplaisir <jean-isaac-fm@live.fr>2015-02-02 01:42:52 +0100
committerJean Fabre-Monplaisir <jean-isaac-fm@live.fr>2015-02-02 01:42:52 +0100
commit582e13dcafe9a33c8d04b469bb7efafc0f6b7687 (patch)
tree0675bcce6af032fa3befd6429c2178adb9052a56 /problem.hpp
parente3420a0d3db79f0e0216c4fca2fc91078ddb4543 (diff)
parent5a91fdc1a3d4b140d75bd96a0bdf308de6789478 (diff)
downloadRobotique-Projet-582e13dcafe9a33c8d04b469bb7efafc0f6b7687.tar.gz
Robotique-Projet-582e13dcafe9a33c8d04b469bb7efafc0f6b7687.zip
Merge branch 'master' of github.com:Alexis211/Robotique
Diffstat (limited to 'problem.hpp')
-rw-r--r--problem.hpp2
1 files changed, 2 insertions, 0 deletions
diff --git a/problem.hpp b/problem.hpp
index 4933ed6..e51b722 100644
--- a/problem.hpp
+++ b/problem.hpp
@@ -92,6 +92,8 @@ struct solution {
// simple direct solution from A to B, takes into account no obstacles
static std::vector<solution> direct_sol(const hilare_a &pos_a, const hilare_a &pos_b);
+ // same but try to rotate a bit before and after
+ static std::vector<solution> direct_sol_r(const hilare_a &pos_a, const hilare_a &pos_b);
// check if a solution intersects an obstacle of problem
bool intersects(const problem &p) const;