๐ŸŽ›๏ธ Input Methods

๐ŸŽฏ Interactive K-map:

โ€ข Left click: Cycle through 0 โ†’ 1 โ†’ X (don't care) โ†’ 0
โ€ข Right click: Reset cell to empty
โ€ข Hover: See cell position and value

๐Ÿ“Š Results & Analysis

๐ŸŽฏ Professional K-Map Solver

๐Ÿ“‹ How to Use:

1. Select Variables: Choose 2, 3, or 4 variables using the buttons
2. Choose Input Method:
   โ€ข Manual: Click cells directly on the K-map
   โ€ข Minterms (โˆ‘): Enter positions where output = 1
   โ€ข Maxterms (ฯ€): Enter positions where output = 0
   โ€ข Truth Table: Enter complete binary sequence
3. Input Data: Enter your boolean function values
4. Analyze: Click "Solve" for simplified expressions
5. Visualize: Click "Group" to see optimization patterns

๐Ÿ”ง Key Features:
โ€ข Dual Format Support: Both SOP (Sum of Products) and POS (Product of Sums)
โ€ข Don't Care Optimization: Use 'X' values for maximum simplification
โ€ข Visual Grouping: Color-coded prime implicant identification
โ€ข Performance Metrics: Gate count reduction and optimization analysis
โ€ข Interactive Examples: Pre-loaded demonstrations for learning

๐Ÿ“š Example Functions:
โ€ข Minterm Format: โˆ‘(0,2,5,7,8,10,13,15) - where F=1
โ€ข Maxterm Format: ฯ€(0,3,6,7) - where F=0
โ€ข Truth Table: 1X01X110 - complete sequence

๐Ÿ’ก Understanding the Interface

๐ŸŽจ Color Coding System:
โ€ข Green Cells: Output value = 1 (True)
โ€ข Red Cells: Output value = 0 (False)
โ€ข Orange Cells: Don't Care (X) - can be 0 or 1
โ€ข Blue Borders: Prime implicant groups

๐Ÿ” Analysis Results:
โ€ข Simplified Expression: Minimized boolean equation
โ€ข Gate Count: Number of logic gates needed
โ€ข Optimization %: Reduction in circuit complexity
โ€ข Prime Implicants: Essential groupings for minimization

โšก Quick Actions:
โ€ข Left Click: Cycle through 0 โ†’ 1 โ†’ X โ†’ 0
โ€ข Right Click: Reset cell to empty
โ€ข Example Buttons: Load pre-configured demonstrations
โ€ข Clear Button: Reset entire K-map to start over