14 commits

Author	SHA1	Message	Date
Dan Cojocaru	1f8dda0d66	Improved marking and pathfinding	2021-12-07 10:51:46 +02:00
Dan Cojocaru	70fb7dcf9f	Fixed bug where start node was valid move	2021-12-07 10:42:37 +02:00
Dan Cojocaru	e8992f8b06	Update threshold increasing	2021-12-07 10:39:43 +02:00
Dan Cojocaru	57c4728e6a	Remove backtracking	2021-12-06 18:44:25 +02:00
Dan Cojocaru	055fa3aa3c	Added N+E+S+W and ALL constants in NDirections	2021-12-06 16:37:32 +02:00
DariusTFox	1cc2a88d8b	Removed unnecessary comments	2021-12-06 16:05:45 +02:00
Dan Cojocaru	7a45a2ff7b	Change empty from ' ' to '.' to avoid confusion	2021-12-05 00:02:56 +02:00
Dan Cojocaru	dbe2cfd500	Fixed threshold computation ... Also made the implementation less generic and less of a headache; int everything! Show the threshold when printing intermediary steps.	2021-12-02 00:44:28 +02:00
Dan Cojocaru	33d3b77d53	Fix bug lol	2021-12-02 00:17:24 +02:00
Dan Cojocaru	6e0bb36132	Forgot minor things about IDA* ... Minor things like avoiding obstacles...	2021-12-02 00:04:10 +02:00
Dan Cojocaru	778ffca169	Implement the rest of IDA*	2021-12-01 23:49:31 +02:00
Dan Cojocaru	1e70b4c1f1	Added IDA* control step ... Added flow control to find start+destination points, and increase the threshold if a search doesn't reach the destination. Next step: implement search.	2021-12-01 22:56:32 +02:00
Dan Cojocaru	d4ec7b36d5	Added initial algorithm skeleton ... Actually just fluff that surrounds it basically.	2021-12-01 21:16:04 +02:00
DariusTFox24	59c139cbbf	Initial commit	2021-12-01 20:16:53 +02:00