diff --git a/src/gui/engine.cpp b/src/gui/engine.cpp
index 38a16b137..2539ad0c3 100644
--- a/src/gui/engine.cpp
+++ b/src/gui/engine.cpp
@@ -241,4 +241,4 @@ void render(float elapsed_time)
     }
 }
 
-}
\ No newline at end of file
+}
diff --git a/src/ide/Xcode/STK_XCode.xcodeproj/project.pbxproj b/src/ide/Xcode/STK_XCode.xcodeproj/project.pbxproj
index 4c021b618..467d7cc40 100644
--- a/src/ide/Xcode/STK_XCode.xcodeproj/project.pbxproj
+++ b/src/ide/Xcode/STK_XCode.xcodeproj/project.pbxproj
@@ -2324,6 +2324,7 @@
 				INFOPLIST_FILE = "SuperTuxKart-Info.plist";
 				INSTALL_PATH = "$(HOME)/Applications";
 				LIBRARY_SEARCH_PATHS = "$(inherited)";
+				OTHER_LDFLAGS = "-lirrlicht";
 				PREBINDING = NO;
 				PRECOMPS_INCLUDE_HEADERS_FROM_BUILT_PRODUCTS_DIR = NO;
 				PRODUCT_NAME = SuperTuxKart;
@@ -2353,6 +2354,7 @@
 				INFOPLIST_FILE = "SuperTuxKart-Info.plist";
 				INSTALL_PATH = "$(HOME)/Applications";
 				LIBRARY_SEARCH_PATHS = "$(inherited)";
+				OTHER_LDFLAGS = "-lirrlicht";
 				PREBINDING = NO;
 				PRECOMPS_INCLUDE_HEADERS_FROM_BUILT_PRODUCTS_DIR = NO;
 				PRODUCT_NAME = SuperTuxKart;
diff --git a/src/robots/default_robot.cpp b/src/robots/default_robot.cpp
index b201e2768..04664ced1 100644
--- a/src/robots/default_robot.cpp
+++ b/src/robots/default_robot.cpp
@@ -85,7 +85,7 @@ DefaultRobot::DefaultRobot(const std::string& kart_name,
         }
     };
 
-    const int look_ahead=10;
+    const unsigned int look_ahead=10;
     // Now compute for each node in the graph the list of the next 'look_ahead'
     // graph nodes. This is the list of node that is tested in checkCrashes.
     // If the look_ahead is too big, the AI can skip loops (see 
diff --git a/src/tracks/quad_graph.cpp b/src/tracks/quad_graph.cpp
index 11149c2de..01a858278 100644
--- a/src/tracks/quad_graph.cpp
+++ b/src/tracks/quad_graph.cpp
@@ -350,7 +350,7 @@ int QuadGraph::findOutOfRoadSector(const Vec3& xyz,
         if(all_sectors) 
             next_sector = (*all_sectors)[j];
         else
-            next_sector  = current_sector+1 == getNumNodes() ? 0 : current_sector+1;
+            next_sector  = current_sector+1 == (int)getNumNodes() ? 0 : current_sector+1;
 
         float dist_2 = xyz.distance2(getQuad(next_sector).getCenter()-xyz);
         if(dist_2<min_dist_2)