variables.h
changeset 1700 e1fe3446d013
parent 1688 af2bb9bcb2ed
child 1751 009a240d035a
--- a/variables.h	Fri Apr 15 13:50:08 2005 +0000
+++ b/variables.h	Fri Apr 15 15:28:01 2005 +0000
@@ -192,9 +192,19 @@
 	byte drag_signals_density; // many signals density
 	bool ainew_active;  // Is the new AI active?
 
-	/* New Path Finding */
+	/*
+	 * New Path Finding
+	 */
 	bool new_pathfinding_all; /* Use the newest pathfinding algorithm for all */
 
+	/**
+	 * The maximum amount of search nodes a single NPF run should take. This
+	 * limit should make sure performance stays at acceptable levels at the cost
+	 * of not being perfect anymore. This will probably be fixed in a more
+	 * sophisticated way sometime soon
+	 */
+	uint32 npf_max_search_nodes;
+
 	uint32 npf_rail_firstred_penalty; /* The penalty for when the first signal is red (and it is not an exit or combo signal) */
 	uint32 npf_rail_firstred_exit_penalty; /* The penalty for when the first signal is red (and it is an exit or combo signal) */
 	uint32 npf_rail_lastred_penalty; /* The penalty for when the last signal is red */