Computer Engineering is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Computer Engineering

Artificial Intelligence

Agents, search, games and CSPs, logic and resolution, planning.

Interview questions
Your progress in this subject0 of 19 · 0%
  1. 1Foundations and history of AIFoundations and history of AI: core definitions, key theorems (Turing test, Church–Turing, halting undecidability, Gödel), major paradigms (symbolic vs connectionist), timeline of milestones, and how these shape modern AI practice.
  2. 2Intelligent agents and rationalityConcise, exam-focused notes on intelligent agents and rationality: definitions, agent types, PEAS, expected utility, worked examples, common pitfalls and exam tips.
  3. 3Environments and agent structuresEnvironment types and agent structures: how agents map percepts to actions, models of environments, and standard agent architectures (reflex, model-based, goal-based, utility-based, learning) used to design rational agents.
  4. 4Informed search: greedy best-first and A*Informed search uses heuristic functions to guide search; greedy best-first uses only the heuristic h and is fast but not guaranteed optimal, while A* uses f = g + h and is complete and optimal when h is admissible (and more efficient if h is consistent).
  5. 5Iterative deepening and heuristic functionsIterative deepening search (IDDFS) trades extra node generation for linear memory; heuristic functions (admissible, consistent) guide informed search like A* and determine optimality and efficiency.
  6. 6Local search: hill climbing, simulated annealing and local beam searchLocal search methods (hill climbing, simulated annealing, local beam search) are iterative optimization algorithms used by engineers to find good solutions in large state spaces where complete search is infeasible.
  7. 7Online search agentsOnline search agents are agents that interleave planning and action without a complete model of the world, using local percepts and learning (heuristic updates) to find goals in unknown or partially known state spaces.
  8. 8Game playing and minimaxMinimax is the fundamental algorithm for computing optimal moves in finite, deterministic, zero-sum, perfect-information games by searching the game tree and choosing moves by backward induction.
  9. 9Alpha–beta pruningAlpha–beta pruning speeds up minimax search in two-player, zero-sum, perfect-information games by cutting branches that cannot affect the final decision.
  10. 10Monte Carlo tree search and stochastic gamesMonte Carlo Tree Search (MCTS) is a simulation-based search algorithm used to solve large sequential decision problems and stochastic games by growing a search tree with random (or policy-based) playouts, combined with a selection rule such as UCT to balance exploration and exploitation.
  11. 11Constraint satisfaction problemsConstraint satisfaction problems (CSPs) formalise many engineering design and scheduling tasks: they are solved by search plus constraint propagation (arc consistency, forward checking, MAC) and by exploiting structure (tree-structured CSPs).
  12. 12Constraint propagation and backtracking searchConstraint propagation and backtracking search are core CSP methods: reduce domains by local consistency (propagation) and systematically search remaining choices (backtracking) with heuristics to solve combinatorial problems like scheduling, allocation, and puzzles.
  13. 13Knowledge-based agents and logicStudy notes on knowledge-based agents and logic: definitions, laws, CNF conversion, inference (forward/backward chaining, resolution), worked examples, common mistakes and exam tips.
  14. 14Propositional logic and inferenceClear, exam-focused study notes on propositional logic and inference: definitions, laws, CNF conversion, resolution, soundness/completeness, worked exam-style proofs and common errors.
  15. 15First-order predicate logicFirst-order predicate logic (FOL) extends propositional logic with predicates, quantifiers and variables to express relations about objects; it is the foundation for knowledge representation and automated reasoning in AI.
  16. 16Unification and resolutionUnification finds substitutions that make logical terms identical; resolution uses unification to derive contradictions (refutation) and is a central proof method in first-order logic and automated theorem proving.
  17. 17Planning and the blocks worldConcise study notes on classical planning and the blocks world: STRIPS formalism, state-transition equations, forward/backward search, Graphplan and partial-order planning, with worked blocks-world examples and exam guidance.
  18. 18Goal stack, nonlinear and hierarchical planningGoal stack (linear) planning, nonlinear (partial-order) planning, and hierarchical task-network (HTN) planning: definitions, algorithms, examples (blocks world and HTN sandwich), and exam guidance.
  19. 19Industrial applications of AIIndustrial applications of AI cover using machine learning, computer vision, planning and optimization to improve manufacturing quality, predictive maintenance, supply-chain and robotics, with decision rules and cost-based thresholds derived from Bayesian reasoning.

Coming next in Artificial Intelligence

  1. Problem formulation and state-space search· notes coming
  2. Uninformed search: BFS, DFS and uniform-cost search· notes coming
  3. Knowledge representation: issues and approaches· notes coming
  4. Natural deduction· notes coming
  5. Rule-based knowledge: procedural vs declarative· notes coming
  6. Forward and backward reasoning· notes coming
  7. Uncertainty and Bayesian networks· notes coming
  8. Dempster–Shafer theory· notes coming
  9. Fuzzy sets and fuzzy logic in AI· notes coming
  10. Natural language understanding: syntax, semantics and pragmatics· notes coming
  11. Forms of learning and inductive learning· notes coming
  12. Learning decision trees· notes coming
  13. Explanation-based learning· notes coming
  14. Neural-net and genetic learning· notes coming
  15. Expert systems, shells and knowledge acquisition· notes coming
  16. Production systems and problem characteristics· notes coming
  17. Problem reduction and AO* search· notes coming
  18. Semantic nets, frames and scripts· notes coming
  19. AI, ML, deep learning and data science· notes coming
  20. Hidden Markov models· notes coming
  21. AI platforms: Azure ML, Google AI and TensorFlow· notes coming