mit-emerging-talent / 2024-group-12-cdsp Goto Github PK

Find all potential paths a knight can take on a 'n' x 'n' chessboard to visit every square exactly once.

Generate all possible words that can be formed by a given list of characters and match a specified pattern. The pattern may contain letters and wildcard characters representing any character.

Develop a solution to determine whether a given string adheres to a specified pattern, where the pattern may contain letters and wildcard characters representing any character.

Date: [13/02/2024]

• Project Progress Overview:

  • Update on overall project progress and challenges faced with repository access.

• GitHub Repository:

  • Discuss the decision to use a new repository.
  • Seek guidance on repository structure.

• Content Organization:

  • Determine file structure for the project: single comprehensive file or separate files.

• Closing Remarks:

  • Final comments or questions.

Determine the optimal move for a player in a game of tic-tac-toe using the minimax algorithm.