<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <nonSort>The </nonSort>
    <title>computer always wins</title>
    <subTitle>: a playful introduction to algorithms through puzzles and strategy games</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>Lichtman, Elliot</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">mau</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Cambridge, MA</placeTerm>
    </place>
    <publisher>The MIT Press</publisher>
    <dateIssued>2025</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>182 pages : illustrations (some color) ; 23 cm.</extent>
  </physicalDescription>
  <abstract>An engaging and approachable resource for beginning-to-intermediate coders eager to learn advanced ideas in computer programming.

In The Computer Always Wins, Elliot Lichtman will teach you some of computer science’s most powerful concepts in a refreshingly accessible way: exploring them through word games, board games, and strategy games you already know. Learn recursion by playing tic-tac-toe, efficient search through puzzle games like sudoku and Wordle, and machine learning by way of the playground classic rock-paper-scissors. Finish the book, and you’ll come away with not only a deeper understanding of these foundational programming techniques but also a new appreciation for the amazing feats that can be accomplished using simple, readable code.</abstract>
  <tableOfContents>How to use this book — Why algorithms? — Chapter summaries — Searching and sorting. Guess wrong answers — Road not taken — One step at a time — Turn-based strategy games. Whose turn is it anyways — Move faster — Pruning — Random simulation. Throwing darts — Aiming darts — Aiming darts at others — Tracking and training. Rock, paper...paper — Black boxes — Minimizing regret — Afterword — Python review.</tableOfContents>
  <note type="statement of responsibility">/ Elliot Lichtman.</note>
  <subject authority="lcsh">
    <topic>Computer algorithms</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Board games</topic>
    <topic>Mathematics</topic>
  </subject>
  <classification authority="lcc">QA76.9.A43 L54 2025</classification>
  <identifier type="isbn">9780262551694</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">OCoLC-P</recordContentSource>
    <recordCreationDate encoding="marc">240617</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251008104837.0</recordChangeDate>
    <recordIdentifier>17615521</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
