6 Commits

Author	SHA1	Message	Date
Dhruv Manilawala	f3ba9b6c50	[mypy] Add/fix type annotations for backtracking algorithms (#4055) ... * Fix mypy errors for backtracking algorithms * Fix CI failure	2020-12-24 18:16:21 +05:30
Du Yuanchao	b81fcef66b	Fixed linked list bug (#2481) ... * * fixed __getitem__() function * add test * * updated doctests * updated __setitem__() func * fixup! Format Python code with psf/black push Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>	2020-09-25 18:08:57 +02:00
Abdujabbar Mirkhalikov	53c2a24587	added type hints and doctests for minimax algorithm (#2478) ... * added type hints and doctests for minimax algorithm * Update backtracking/minimax.py Co-authored-by: Christian Clauss <cclauss@me.com> * last fix Co-authored-by: Christian Clauss <cclauss@me.com>	2020-09-25 15:16:05 +02:00
Christian Clauss	1f8a21d727	Tighten up psf/black and flake8 (#2024) ... * Tighten up psf/black and flake8 * Fix some tests * Fix some E741 * Fix some E741 * updating DIRECTORY.md Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>	2020-05-22 08:10:11 +02:00
William Zhang	9eac17a408	psf/black code formatting (#1277)	2019-10-05 10:14:13 +05:00
Aditi Agarwal	4ff2a9dd4e	minimax (#947) ... * minimax.py minimax algorithm is used for game like tic tac toe. It traces the path and selects the optimal move. * minimax.py Minimax is used in decision making and game theory to find the optimal move for a player, when your opponent also plays optimally. It is widely used in games like Tic-Tac-Toe, Chess. * Delete minimax.py * Update minimax.py * Minimax is a backtracking algorithm that is used in game theory to find the optimal move for a player, assuming that your opponent also plays optimally	2019-07-07 06:59:58 +02:00