<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: MOULIK CHOUDHARY</title>
    <description>The latest articles on DEV Community by MOULIK CHOUDHARY (@moulikai).</description>
    <link>https://dev.to/moulikai</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3955646%2Fded07e0e-3555-40e0-8c3a-79d26e2b22c3.jpeg</url>
      <title>DEV Community: MOULIK CHOUDHARY</title>
      <link>https://dev.to/moulikai</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/moulikai"/>
    <language>en</language>
    <item>
      <title>DPLL Demystified — A Traceable C++ SAT Solver</title>
      <dc:creator>MOULIK CHOUDHARY</dc:creator>
      <pubDate>Sun, 07 Jun 2026 04:01:36 +0000</pubDate>
      <link>https://dev.to/moulikai/-4m2c</link>
      <guid>https://dev.to/moulikai/-4m2c</guid>
      <description>&lt;div class="ltag__link--embedded"&gt;
  &lt;div class="crayons-story "&gt;
  &lt;a href="https://dev.to/moulikai/finish-up-a-thon-teaching-dpll-a-minimal-traceable-c-sat-solver-3am" class="crayons-story__hidden-navigation-link"&gt;Finish-Up-A-Thon: Teaching DPLL — A Minimal, Traceable C++ SAT Solver&lt;/a&gt;


  &lt;div class="crayons-story__body crayons-story__body-full_post"&gt;
      &lt;a href="https://dev.to/moulikai/finish-up-a-thon-teaching-dpll-a-minimal-traceable-c-sat-solver-3am" class="crayons-article__context-note crayons-article__context-note__feed"&gt;&lt;p&gt;GitHub “Finish-Up-A-Thon” Challenge Submission&lt;/p&gt;

&lt;/a&gt;
    &lt;div class="crayons-story__top"&gt;
      &lt;div class="crayons-story__meta"&gt;
        &lt;div class="crayons-story__author-pic"&gt;

          &lt;a href="/moulikai" class="crayons-avatar  crayons-avatar--l  "&gt;
            &lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3955646%2Fded07e0e-3555-40e0-8c3a-79d26e2b22c3.jpeg" alt="moulikai profile" class="crayons-avatar__image" width="460" height="460"&gt;
          &lt;/a&gt;
        &lt;/div&gt;
        &lt;div&gt;
          &lt;div&gt;
            &lt;a href="/moulikai" class="crayons-story__secondary fw-medium m:hidden"&gt;
              MOULIK CHOUDHARY
            &lt;/a&gt;
            &lt;div class="profile-preview-card relative mb-4 s:mb-0 fw-medium hidden m:inline-block"&gt;
              
                MOULIK CHOUDHARY
                
              
              &lt;div id="story-author-preview-content-3836351" class="profile-preview-card__content crayons-dropdown branded-7 p-4 pt-0"&gt;
                &lt;div class="gap-4 grid"&gt;
                  &lt;div class="-mt-4"&gt;
                    &lt;a href="/moulikai" class="flex"&gt;
                      &lt;span class="crayons-avatar crayons-avatar--xl mr-2 shrink-0"&gt;
                        &lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3955646%2Fded07e0e-3555-40e0-8c3a-79d26e2b22c3.jpeg" class="crayons-avatar__image" alt="" width="460" height="460"&gt;
                      &lt;/span&gt;
                      &lt;span class="crayons-link crayons-subtitle-2 mt-5"&gt;MOULIK CHOUDHARY&lt;/span&gt;
                    &lt;/a&gt;
                  &lt;/div&gt;
                  &lt;div class="print-hidden"&gt;
                    
                      Follow
                    
                  &lt;/div&gt;
                  &lt;div class="author-preview-metadata-container"&gt;&lt;/div&gt;
                &lt;/div&gt;
              &lt;/div&gt;
            &lt;/div&gt;

          &lt;/div&gt;
          &lt;a href="https://dev.to/moulikai/finish-up-a-thon-teaching-dpll-a-minimal-traceable-c-sat-solver-3am" class="crayons-story__tertiary fs-xs"&gt;&lt;time&gt;Jun 6&lt;/time&gt;&lt;span class="time-ago-indicator-initial-placeholder"&gt;&lt;/span&gt;&lt;/a&gt;
        &lt;/div&gt;
      &lt;/div&gt;

    &lt;/div&gt;

    &lt;div class="crayons-story__indention"&gt;
      &lt;h2 class="crayons-story__title crayons-story__title-full_post"&gt;
        &lt;a href="https://dev.to/moulikai/finish-up-a-thon-teaching-dpll-a-minimal-traceable-c-sat-solver-3am" id="article-link-3836351"&gt;
          Finish-Up-A-Thon: Teaching DPLL — A Minimal, Traceable C++ SAT Solver
        &lt;/a&gt;
      &lt;/h2&gt;
        &lt;div class="crayons-story__tags"&gt;
            &lt;a class="crayons-tag  crayons-tag--monochrome " href="/t/devchallenge"&gt;&lt;span class="crayons-tag__prefix"&gt;#&lt;/span&gt;devchallenge&lt;/a&gt;
            &lt;a class="crayons-tag  crayons-tag--monochrome " href="/t/githubchallenge"&gt;&lt;span class="crayons-tag__prefix"&gt;#&lt;/span&gt;githubchallenge&lt;/a&gt;
        &lt;/div&gt;
      &lt;div class="crayons-story__bottom"&gt;
        &lt;div class="crayons-story__details"&gt;
          &lt;a href="https://dev.to/moulikai/finish-up-a-thon-teaching-dpll-a-minimal-traceable-c-sat-solver-3am" class="crayons-btn crayons-btn--s crayons-btn--ghost crayons-btn--icon-left"&gt;
            &lt;div class="multiple_reactions_aggregate"&gt;
              &lt;span class="multiple_reactions_icons_container"&gt;
                  &lt;span class="crayons_icon_container"&gt;
                    &lt;img src="https://assets.dev.to/assets/sparkle-heart-5f9bee3767e18deb1bb725290cb151c25234768a0e9a2bd39370c382d02920cf.svg" width="24" height="24"&gt;
                  &lt;/span&gt;
              &lt;/span&gt;
              &lt;span class="aggregate_reactions_counter"&gt;1&lt;span class="hidden s:inline"&gt;&amp;nbsp;reaction&lt;/span&gt;&lt;/span&gt;
            &lt;/div&gt;
          &lt;/a&gt;
            &lt;a href="https://dev.to/moulikai/finish-up-a-thon-teaching-dpll-a-minimal-traceable-c-sat-solver-3am#comments" class="crayons-btn crayons-btn--s crayons-btn--ghost crayons-btn--icon-left flex items-center"&gt;
              

              &lt;span class="hidden s:inline"&gt;Add&amp;nbsp;Comment&lt;/span&gt;
            &lt;/a&gt;
        &lt;/div&gt;
        &lt;div class="crayons-story__save"&gt;
          &lt;small class="crayons-story__tertiary fs-xs mr-2"&gt;
            2 min read
          &lt;/small&gt;
            
              &lt;span class="bm-initial crayons-icon c-btn__icon"&gt;
                

              &lt;/span&gt;
              &lt;span class="bm-success crayons-icon c-btn__icon"&gt;
                

              &lt;/span&gt;
            
        &lt;/div&gt;
      &lt;/div&gt;
    &lt;/div&gt;
  &lt;/div&gt;
&lt;/div&gt;

&lt;/div&gt;


</description>
      <category>devchallenge</category>
      <category>githubchallenge</category>
      <category>programming</category>
      <category>cpp</category>
    </item>
    <item>
      <title>Finish-Up-A-Thon: Teaching DPLL — A Minimal, Traceable C++ SAT Solver</title>
      <dc:creator>MOULIK CHOUDHARY</dc:creator>
      <pubDate>Sat, 06 Jun 2026 18:08:54 +0000</pubDate>
      <link>https://dev.to/moulikai/finish-up-a-thon-teaching-dpll-a-minimal-traceable-c-sat-solver-3am</link>
      <guid>https://dev.to/moulikai/finish-up-a-thon-teaching-dpll-a-minimal-traceable-c-sat-solver-3am</guid>
      <description>&lt;p&gt;&lt;em&gt;This is a submission for the &lt;a href="https://dev.to/challenges/github-2026-05-21"&gt;GitHub Finish-Up-A-Thon Challenge&lt;/a&gt;&lt;/em&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  What I Built
&lt;/h2&gt;

&lt;p&gt;Project: SAT Solver (C++): a compact, educational SAT solver that parses DIMACS CNF files and uses a DPLL-based algorithm with unit propagation and pure-literal elimination.&lt;br&gt;
Project Link: &lt;a href="https://github.com/Moulik-ai/sat-solver" rel="noopener noreferrer"&gt;SAT Solver&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Scope: Command-line tool that reads CNF files, determines satisfiability, and prints a satisfying assignment when found.&lt;/p&gt;

&lt;p&gt;Key features: robust DIMACS parsing, three-state assignments (TRUE/FALSE/UNASSIGNED), DPLL backtracking, unit propagation, pure-literal elimination, explanation trace mode, step-by-step interactive trace, and trace export to file.&lt;/p&gt;

&lt;p&gt;Why it matters: This repo is a small, teachable implementation of a fundamental algorithm in logic and theoretical CS — useful for students learning SAT solving, debugging CNF problems, or demonstrating algorithmic decision tracing.&lt;/p&gt;

&lt;h2&gt;
  
  
  Demo
&lt;/h2&gt;

&lt;p&gt;Live demo (local):&lt;br&gt;
Build and run locally:&lt;br&gt;
Build: make or build.bat&lt;br&gt;
Run a sample: .sat_solver.exe test\sample.cnf&lt;br&gt;
Explanation run: .sat_solver.exe --explain test\sample.cnf&lt;br&gt;
Step-by-step: .sat_solver.exe --step test\unit_propagation.cnf&lt;br&gt;
Write trace: .sat_solver.exe --explain --trace-out trace.txt test\pure_literal.cnf&lt;/p&gt;

&lt;p&gt;Screenshot: &lt;br&gt;
&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fevdecpx908772e2iaih5.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fevdecpx908772e2iaih5.png" alt=" " width="250" height="91"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  The Comeback Story
&lt;/h2&gt;

&lt;p&gt;Before: The project had a working solver core but limited DIMACS validation, no interactive trace, and no easy build/test helpers.&lt;/p&gt;

&lt;p&gt;What I changed:&lt;br&gt;
Strengthened parser: strict p cnf header checks, literal range validation, header/clauses count warnings, and graceful inference if header missing.&lt;br&gt;
Added user-facing features: --explain trace mode, --step interactive mode (pauses after each logged step), and --trace-out  to export traces.&lt;br&gt;
Added developer convenience: Makefile, build.bat, and run_tests.ps1 to build and run test CNFs easily.&lt;/p&gt;

&lt;p&gt;Improved documentation: updated README.md with new flags and usage examples.&lt;/p&gt;

&lt;p&gt;Impact: The solver is now more robust for classroom demos and easier to build/test across platforms. Students can follow decision traces live or export runs for analysis.&lt;/p&gt;

&lt;h2&gt;
  
  
  My Experience with GitHub Copilot
&lt;/h2&gt;

&lt;p&gt;How Copilot helped: Copilot suggested idiomatic C++ patterns and small refactorings while I implemented parser validation and trace export. It sped up routine tasks (e.g., string formatting, logging snippets) and helped prototype the step-mode interaction.&lt;br&gt;
Human + AI workflow: I used Copilot as a coding assistant and then verified and adapted suggestions manually — ensuring correctness and adding precise error messages and tests.&lt;br&gt;
Takeaway: Copilot is most valuable for accelerating boilerplate and surfacing implementation ideas; final correctness and UX decisions still require human review.&lt;/p&gt;

</description>
      <category>devchallenge</category>
      <category>githubchallenge</category>
    </item>
  </channel>
</rss>
