Frequently asked questions

This site celebrates NYT crosswords and the people who make them. It provides a comprehensive list of every daily puzzle (and most Variety puzzles) going back to the very first NYT crossword published on Sunday, February 15, 1942. Puzzles with special attributes are noted. Records in various categories are tracked. Shortz Era data is organized by constructor — a feature unique to this site.

See the Grand Tour for a list of features organized by target audience.

The best approach is to poke around and explore. You can view lists of puzzles that meet various criteria, click on a puzzle to see it displayed in full with the answers, click on an answer to see what clues have been used for it, click on the displayed date to see the answer word in context, etc.

This site is expensive to run. Your payments help offset those costs.

If all you are looking for are answers to recent clues, the 45 most recent puzzles are always freely available. Older pre-Shortz puzzles are also always available. In fact, you can both see them and even solve them online for free!

Many other pages require you to sign up for an XWord Info account.

Only to download PDF and Across Lite files. These come directly from nytimes.com.

In other words, XWord Info does not help you get access to downloadable puzzles that are property of the New York Times. Sign up for an NYT Games account here.

I'm glad you asked! Pages requested via links on blogs or other sites are allowed to come through without registration.

XWord Info is an essential resource for constructors, and crossword enthusiasts will discover interesting insights. Casual solvers will find puzzle solutions and can learn about the rich history of their hobby.

When Jim Horne started blogging about crosswords, he wondered what he could learn about NYT puzzles through statistical analysis, so in 2007, he started XWord Info. In October 2008, his blog moved to The New York Times where he started the Wordplay column, writing there for three years.

Nah. We do our best to expand rebus entries (including ones that are interpreted differently in different directions) and even correctly parse answers that go around corners or do other such tricks, but there are likely still bugs. Please let us know if you spot any.

Puzzles from October 23, 1996, to the present come from the Across Lite files on the nytimes.com website. Originally, that was all we thought we would ever be able to get, but we learned that Barry Haldiman has been collecting crosswords in electronic form for a long time and he has graciously offered to share some of them. Thanks to Mr. Haldiman, we acquired NYT puzzles covering the entire Will Shortz Era back to November 21, 1993.

In 2012, David Steinberg started The Pre-Shortzian Puzzle Project dedicated to digitizing earlier NYT crosswords. On August 26, 2015, the project declared victory. All known NYT crosswords are now available here on XWord Info. Pre-Shortz stats are kept separate from Shortz Era data.

Constructor photos are courtesy of the puzzle authors themselves. We are grateful to them all.

• Row and Column count refers to the size of the grid
• Words is the number of clues or answers. Single answers that are phrases count as one word. NYT guidelines call for a maximum of 78 words for 15x15 puzzles, and 140 words for 21x21 grids. These are sometimes exceeded to handle special themes.
• Blocks is the number of black squares.
• Average word length is an obvious mathematical calculation. Puzzles with higher averages tend to be harder to construct.
• Missing letters are ones that are absent from the grid. Puzzles that use all 26 letters are said to be pangrams.
• Scrabble average is the total tile value of all the letters divided by the number of letters.
• Open squares is an XWord Info invention. Grids seem open if they have large areas of white space. This calculation counts the number of white squares that are not next to black squares, even diagonally.
• Cheater squares are black squares that can be removed without affecting the overall word count of the grid. Constructors often try to avoid these, but some are often inevitable and many great puzzles have plenty of cheaters. If you click the "Analyze" button, you'll see cheater squares marked with a + in the colorized grid.
• Debuts is the number of words that first appeared in this puzzle. They are colored differently in the answer section. Sometimes the number of words that are reused (they debuted on this puzzle but were picked up by other constructors later) is also shown.
• Spans counts the number of answer words that span the full grid. Double, triple, or quadruple stacks are also noted.
• Freshness Factor is an attempt to algorithmically determine how "fresh" a grid is based on how many times we've seen its answer words used before. You can see calculation details here.

If they are statistically significant in some way, perhaps there is a particularly low block count or high Scrabble average, they are highlighted in a yellow block. Click the highlighted link to see the relevant stats page and it should be clear why the stat is called out.

Dates here match the publication dates in the New York Times. In syndication, the Sunday puzzle runs a week behind, and the dailies are five weeks behind. There is a link to the syndicated puzzle on the home page, or you can go to the Calendar page and count back the appropriate number of weeks.

XWord Information takes advantage of recent HTML 5 and new CSS capabilities to provide the best experience. Older browsers may not support all the capabilities we need. The latest versions of Edge, Chrome, Safari, and Firefox all work fine.

Yes.

XWord Info is built largely on Microsoft technology. It is an ASP.NET web application running on IIS Windows web servers. LINQ is used to manage the data stored in SQL Server. Software development is done on Visual Studio 2019 with the help of ReSharper. Server-side code is written in C#. Some client-side JavaScript relies on jQuery and a few of its associated libraries. All pages declare the HTML 5 doctype, and we use many new HTML 5 capabilities. Now you know.

Mostly from Princeton University. To make it available here, we're required to provide this notice:

WordNet 3.0 Copyright 2006 by Princeton University. All rights reserved.

THIS SOFTWARE AND DATABASE IS PROVIDED "AS IS" AND PRINCETON UNIVERSITY MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PRINCETON UNIVERSITY MAKES NO REPRESENTATIONS OR WARRANTIES OF MERCHANT-ABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE, DATABASE OR DOCUMENTATION WILL NOT INFRINGE ANY THIRD PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS.

This useful word list includes many proper nouns, names, phrases, etc. Even after removing all items shorter than 3 letters, longer than 23 letters, and any containing digits like Y2K, there are still 142,829 entries.

We use a few other dictionaries as well, totaling 660,101 unique external words.

Short answer: our site is secure, and we protect your data.

We take security seriously. Our pages are served using Secure Sockets Layer (SSL.) That’s the same encryption system your bank uses for web transactions. That lock icon next to the address bar in your browser guarantees that your information cannot be intercepted by third parties.

Passwords on our site are always encrypted. We cannot retrieve your password for you, but we can provide links that let you set a new password if you ever forget yours.

If the “remember me” option is checked when you log in to XWord Info, your encrypted login information is also stored in a cookie in your local browser. This common practice allows you to access our website without having to log on each time. We "remember" you by referencing that cookie.

Unless you’re signed in with an Angel account, you’ll see Google ads on many pages. Google uses cookies to try to learn things about you in an attempt to deliver the most relevant ads. Much of our site is free, and we rely on revenue from Google ads to help pay for the operation of our site.