harvard-cs50ai-tic-tac-toe viniciusfinger · COMPLETED
Implementing Minimax algorithm, a recursive algorithm for choosing the next move in an n-player game. In this case, applied to tic-tac-toe ❌
github.com/viniciusfinger/harvard-cs50ai-tic-tac-toe · ★ 3 · Forks 0 · Size 123 KB
SUMMARY
Technologies 3
Scored 3
Observed 3
Practices 6
Evidence 4
Skips 0
COVERAGE
Analyzed 6 files · 11 commits · 0 API calls
TECHNOLOGIES & DEPTH
Markdown LANGUAGE Depth 70
1 files · PRODUCTION
Python LANGUAGE Depth 70
3 files · PRODUCTION
pip BUILD_TOOL Depth 80
1 files · CONFIGURATION
PRACTICES
documentation · observedautomated_tests · observedcontinuous_integration · absentcontainerization · absentlinting · absentformatting · absent
ACTIVITY & OWNERSHIP
First commit 2024-07-08
Last commit 2024-07-18
Active months 1
Commits 11