Ryan's Documentation

minimaxWPruning

Initializing search

Ryan's Documentation

Ryan's Documentation
Reference
214
214
333
333
- Block Chain
  Block Chain
  - Merkle Tree
  - Proof of Work
- Encryption
  Encryption
  - Ciphers
  - Definitions
  - Design Principles
  - Hashing
  - Password
  - Random
  - Security Concepts
  - Signatures
  - Stories
- Networking
  Networking
  - Data Link Layer
    Data Link Layer
    
    Bridges
  - Network Layer
    Network Layer
    
    Routers
  - Transport
    Transport
    
    TCP
366
366
- Data Structures
- General Properties
- Artifacts
  Artifacts
- Classical Planning
  Classical Planning
  - Delete relaxation heuristics
  - Strips formalism
- Constraint Satisfaction
  Constraint Satisfaction
  - Arc consistency
  - Backtracking
- Informed Search
  Informed Search
  - A* Search
  - Bidirectional A*
  - Greedy Best First Search
  - Heuristics
  - Iterative Deepening A*
  - Meet in the Middle
  - Transposition Tables
  - Weighted A*
  - Weighted Iterative Deepening A*
  - Multi Agent Search
    
    Multi Agent Search
    
    Conflict Based Search
    
    Cooperative A*
- Local Search
  Local Search
- Multi Agent Search
  Multi Agent Search
  - Algorithms
  - Game theory
  - Games
  - Monte carlo tree search
  - Algorithms
    Algorithms
    
    MonteCarloTreeSearch
    
    backwardInduction
    
    Minimax
    
    minimaxWPruning
- Uninformed Search
  Uninformed Search
401
401
Frameworks
Frameworks
- Nestjs
- Vue
Infrastructure
Infrastructure
- Docker
  Docker
- Kubernetes
  Kubernetes
Languages
Languages
- Cpp
  Cpp
- Javascript
  Javascript
  - Asynchronous
- Python
  Python
  - Django
  - Virtual Environments
- Ruby
  Ruby
- Typescript
  Typescript
Tools
Tools
- AI
  AI
- Git
  Git
- Networking
  Networking
- SSH
  SSH
Other
Other

minimaxWPruning

Made with Material for MkDocs