puzzle_id
int64 1
25
| version
stringclasses 5
values | problem_statement
stringlengths 60
829
| param1
stringlengths 1
30
| param2
stringclasses 12
values | param3
stringclasses 6
values | param4
stringclasses 2
values |
|---|---|---|---|---|---|---|
1 | math | How many permutations can be produced by drawing balls numbered 0 to 9 from an urn with replacement 4 times? | 4 | null | null | null |
1 | common | A bike locker has a 4-digit code. How many different codes exist? | 4 | null | null | null |
1 | linguistic_obfuscation | 4 spaceships, called K-23, K-14, K-15 and K-29, are making preparations before going into battle. They have arranged themselves in a straight line. Each of the spaceships has the ability to change the colour of its outside using a program. The possible colors are: black, white, orange, red, blue, green, yellow, purple, brown and grey. If they randomly choose their colors, how many different constellations are there? | 4 | null | null | null |
1 | adversarial | A bike locker has a 4-digit code. The locker is made from 3 materials: copper, silver and steel. How many different codes exist? | 4 | null | null | null |
1 | parametrisation | A bike locker has a 9-digit code. How many different codes exist? | 9 | null | null | null |
2 | math | You draw without replacement from an urn containing 16 balls numbered 1 to 16. How many distinct permutations are there? | 16 | null | null | null |
2 | common | You want to arrange 16 bingo balls in a sequence. How many distinct sequences are there? | 16 | null | null | null |
2 | linguistic_obfuscation | A princess sits in her castle and looks at her 16 beautiful unicorns. Each one has its own name, its own fur colour and its own decorations. The princess wants to impress her subjects with the most amazing parade, one unicorn after the other will ride down the street. She is considering which ordering will be most pleasing: should she start with Tango, followed by Twisty who share the same saddle colour? Or arrange them in a different way? She spends a lot of time imagining how her unicorns will appear in the parade. How many different parades are there? | 16 | null | null | null |
2 | adversarial | There are 100 people watching a lottery show and waiting for the results. You want to arrange 16 bingo balls in a sequence. How many distinct sequences are there? | 16 | null | null | null |
2 | parametrisation | You want to arrange 99 bingo balls in a sequence. How many distinct sequences are there? | 99 | null | null | null |
3 | math | How many distinct ways are there to draw a sequence of 3 balls without replacement from an urn containing balls numbered 1 to 10? | 10 | null | null | null |
3 | common | 10 countries take part in a curling event. How many ways are there to assign the gold, silver and bronze medals to the winning countries? | 10 | null | null | null |
3 | linguistic_obfuscation | 10 bear brothers arrive at Goldilock's house. They are each one year older than the other -- the oldest is 10, the youngest is just one year old. They love the scenery at Goldilock's house. -- Oh, how delicious the pudding smells! -- How soft the bed is! -- And how warm and bubbly the bath that somebody has prepared! The brothers all run forwards and struggle to get to the pudding, the bath and the bed. They fall over each other getting there -- the older ones pushing the younger ones aside, the fastest ones running around the slower ones. But at the end of the day, whatever you do, there is only one bath, one pudding and one bed. How many different outcomes are there for 3 brothers out of the 10 to get the three rewards? | 10 | null | null | null |
3 | adversarial | 10 countries take part in a curling event. How many ways are there to assign the gold, silver and bronze medals to the winning countries? The medals have 3 different shapes: square, oval and round, respectively. | 10 | null | null | null |
3 | parametrisation | 206 countries take part in a curling event. How many ways are there to assign the gold, silver and bronze medals to the winning countries? | 206 | null | null | null |
4 | math | How many valid bracketed sequences are there given 6 positions? Valid bracketed sequence is a valid arithmetic expression from which all numbers and operators have been removed. | 3 | null | null | null |
4 | common | There is a line in a cinema for a movie. The ticket costs 5 pounds. 3 people have a 10 pound banknote each and 3 people have a 5 pound banknote each. At the beginning the ticket cashier does not have any change. How many distinct ways are there to form a line, so that everybody can buy a ticket? | 3 | null | null | null |
4 | linguistic_obfuscation | Many dragons and princes are getting ready for a masquerade ball. There is a guard at the door of the ball, and she will not let anybody enter without a mask. But there is a problem -- princes don't have any masks. Dragons, on the other hand, each are born with two masks, and because they are generous creatures, they want to help as many princes as possible to enter with them. So before entering, each dragon deposits their second mask with the guard, so that the next prince who arrives can enter the masquerade. During one particular hour before the masquerade starts, three dragons and three princes arrive at various times at the door to the ball. How many possible arrival sequences are there so that all six can enjoy the masquerade together? | 3 | null | null | null |
4 | adversarial | There is a line in a cinema for a movie. The ticket costs 5 pounds. 3 people have a 10 pound banknote each and 3 people have a 5 pound banknote each. At the beginning the ticket cashier does not have any change. In addition to cinema tickets all guests get a great deal: a free popcorn box and a can of Coca-Cola or Sprite for just 2 pounds. How many distinct ways are there to form a line, so that everybody can buy a ticket? | 3 | null | null | null |
4 | parametrisation | There is a line in a cinema for a movie. The ticket costs 5 pounds. 5 people have a 10 pound banknote each and 5 people have a 5 pound banknote each. At the beginning the ticket cashier does not have any change. How many distinct ways are there to form a line, so that everybody can buy a ticket? | 5 | null | null | null |
5 | math | Your current position is a place A. You want to reach place B, which is 2 steps to the right of you and 2 steps down. You draw with replacement from an urn with 2 balls labelled 'go 1 step down' and 'go 1 step right'. You draw 4 times. How many sequences will get you to place B? | 3 | null | null | null |
5 | common | There is a 3x3 grid board. A marker is placed in the top left corner. At any given point, the marker has two legal moves: 1. Move down one square; 2. Move right one square; The marker cannot move diagonally. The marker cannot move up or left. How many distinct paths can the marker take to reach the bottom right corner? | 3 | null | null | null |
5 | linguistic_obfuscation | I am on the north-western city block of Manhattan. I can only drive to the city block east or south to the one I am currently at and there are traffic lights at the intersection of blocks. I cannot drive any other direction. How many distinct routes are there for me to get one to the south-eastern city block that is exactly 2 blocks to the east and 2 blocks to the south. | 3 | null | null | null |
5 | adversarial | There is a 3x3 grid board. A marker is placed in the top left corner. At any given point, the marker has two legal moves: 1. Move down one square; 2. Move right one square; The marker cannot move diagonally. The marker cannot move up or left. Initially, the squares of the board are in one of 2 colours, black and white. After each move, the marker changes its color to one of the rainbow colors. How many distinct paths can the marker take to reach the bottom right corner? | 3 | null | null | null |
5 | parametrisation | There is a 101x101 grid board. A marker is placed in the top left corner. At any given point, the marker has two legal moves: 1. Move down one square; 2. Move right one square; The marker cannot move diagonally. The marker cannot move up or left. How many distinct paths can the marker take to reach the bottom right corner? | 101 | null | null | null |
6 | math | How many different permutations of the string AABBBOO exist? | 2 | 3 | 2 | week |
6 | common | Lia has 2 apples, 3 bananas and 2 oranges. For the upcoming week, she wants to eat one fruit every day. How many ways are there to do it? | 2 | 3 | 2 | week |
6 | linguistic_obfuscation | An astronaut is alone in a space station. He has only 7 food rations. There are 3 chicken dinners, 2 steak dinners, and 2 lasagnas. He has also 3 hot drinks left: coffee with milk, herbal tea and a hot chocolate. The astronaut considers very carefully the sequence of foods before him. How many different sequences are there? | 2 | 3 | 2 | week |
6 | adversarial | Lia has 2 apples, 3 bananas and 2 oranges. For the upcoming week, she wants to eat one fruit every day. Apples weigh 100g, bananas weigh 150g and oranges weigh 200g. How many ways are there to do it? | 2 | 3 | 2 | week |
6 | parametrisation | Lia has 11 apples, 10 bananas and 9 oranges. For the upcoming September, she wants to eat one fruit every day. How many ways are there to do it? | 11 | 10 | 9 | September |
7 | math | In an urn there are 5 balls numbered 1 to 5. You draw 5 times without replacement. How many distinct sequences are there starting with ball number 1? | 5 | null | null | null |
7 | common | There are 5 people dancing a circle dance. How many distinct ways are there to arrange them? | 5 | null | null | null |
7 | linguistic_obfuscation | A planetary engineer is creating an expensive wedding present for her fiancee. She arranges 5 stars in a circle in the firmament and makes them constantly go around in a circle. This feat was performed so that the fiancee can admire the engineer's ingenuity every time he looks up at night. The stars chosen are a red dwarf, a red giant, a blue dwarf, a supernova and a white giant. How many different ways can she arrange the 5 stars? | 5 | null | null | null |
7 | adversarial | There are 5 people dancing a circle dance. For each song they perform one of 3 dance styles. How many distinct ways are there to arrange them? | 5 | null | null | null |
7 | parametrisation | There are 23 people dancing a circle dance. How many distinct ways are there to arrange them? | 23 | null | null | null |
8 | math | In an urn there are 10 balls numbered 1 to 10. You draw 3 times without replacement. How many distinct sets of balls are there? | 10 | 3 | null | null |
8 | common | There are 10 students and 3 tickets for a May Ball. How many ways are there to pick the lucky winners? | 10 | 3 | null | null |
8 | linguistic_obfuscation | 10 computational linguists are told that they should attend the King's annual garden party, and that he will randomly choose three of them who will receive a knighthood. The computational linguists are very excited and try to work out how many different ways there are to assign these knighthoods to them. | 10 | 3 | null | null |
8 | adversarial | There are 10 students and 3 tickets for a May Ball. At 9 pm the fireworks begin. There are 5 different types of fireworks arranged in a random sequence. How many ways are there to pick the lucky winners? | 10 | 3 | null | null |
8 | parametrisation | There are 50 students and 15 tickets for a May Ball. How many ways are there to pick the lucky winners? | 50 | 15 | null | null |
9 | math | In an urn there are 3 balls numbered 1 to 3. You draw 6 times with replacement. How many distinct sets of balls are there? | 3 | 9 | null | null |
9 | common | 3 girls found 9 black pearls. How many distinct ways are there to divide all pearls between the girls, so that each girl gets at least one pearl? | 3 | 9 | null | null |
9 | linguistic_obfuscation | Three garbage trucks have been ordered to a hoarder's house. There are only 9 pieces of furniture left at the house, and there is only one parking spot. Furniture will be carried out by the cleaners in a random fashion and whichever truck is in the parking spot will receive the furniture. Trucks take turns with the parking spot. Each truck is allowed in the parking lot only for 5 minutes, and the other trucks circle around the house until their turn comes. The lorry drivers only get paid if each truck carries at least one piece of furniture, so they agree that whatever happens, they will share the furniture so that each truck has at least one piece of furniture. After this process, the trucks arrive at the garbage disposal and the drivers compare how many pieces of furniture each has. How many possibilities are there? | 3 | 9 | null | null |
9 | adversarial | 3 girls found 9 black pearls. To make the diving process easier, the girls can use one or more of 3 tools: a flashlight, a mask and flippers. How many distinct ways are there to divide all pearls between the girls, so that each girl gets at least one pearl? | 3 | 9 | null | null |
9 | parametrisation | 13 girls found 54 black pearls. How many distinct ways are there to divide all pearls between the girls, so that each girl gets at least one pearl? | 13 | 54 | null | null |
10 | math | In an urn there are 3 balls numbered 1 to 3. You draw 9 times with replacement. How many distinct sets of balls are there | 3 | 9 | null | null |
10 | common | 3 girls found 9 white pearls. How many distinct ways are there to divide all pearls between girls? It is not necessary that all girls get pearls. | 3 | 9 | null | null |
10 | linguistic_obfuscation | 3 pirates enter a frigate that has just surrendered to them. They know that there are nine bars of solid gold on board. According to pirate law, any pirate who finds some loot on board a commandeered ship can keep it. They swarm out into every nook and cranny of the ship to find the gold -- each hoping that she will get all nine, and dreading a situation where she finds nothing. How many ways are there to assign the gold bars to the pirates? | 3 | 9 | null | null |
10 | adversarial | 3 girls found 9 white pearls. All girls are professional free divers and can hold their breath from 8 to 10 minutes. How many distinct ways are there to divide all pearls between girls? It is not necessary that all girls get pearls. | 3 | 9 | null | null |
10 | parametrisation | 13 girls found 54 white pearls. How many distinct ways are there to divide all pearls between girls? It is not necessary that all girls get pearls. | 13 | 54 | null | null |
11 | math | In an urn there are 5 balls numbered 1 to 5. You draw 3 times with replacement. How many distinct sets of balls are there? | 5 | 3 | null | null |
11 | common | There are 5 flavors of ice cream. How many ways are there to arrange 3 scoops of ice cream? | 5 | 3 | null | null |
11 | linguistic_obfuscation | A baroness is designing her favorite flower bouquet. Only three flowers fit into her vase, but she has in her garden many sunflowers, dahlias, roses, peonies, and cornflowers. And she likes all of them very much. Even putting the same kind of flower more than once into the vase is an option. Thinking about all the possibilities for doing this, she decides she will delegate this important design task to her chief of staff. How many different arrangements can the chief come up with for her? | 5 | 3 | null | null |
11 | adversarial | There are 5 flavors of ice cream. There was also an additional 6th flavor -- citrus but it was very popular and all scoops of it were already sold. How many ways are there to arrange 3 scoops of ice cream? | 5 | 3 | null | null |
11 | parametrisation | There are 10 flavors of ice cream. How many ways are there to arrange 7 scoops of ice cream? | 10 | 7 | null | null |
12 | math | There are 3 distinct objects. How large is the superset (set of sets) formed out of there? | three | null | null | null |
12 | common | Clare has three cats. Every day, she decides which cats she will feed. How many ways are there for Clare to feed the cats? | three | null | null | null |
12 | linguistic_obfuscation | The emperor's astronomer is observing the sky each night, to do an important calculation for the emperor. She is looking at three particularly beautiful stars -- one in the eastern sky, one in the southern sky and one in the western sky, and recording each night for each of the stars whether they are obscured by clouds even just for a second, or not. After several days of observation, how many different records could she have? | three | null | null | null |
12 | adversarial | Clare has three cats. Every day, she decides which cats she will feed. If a cat was not fed, then it goes to the garden and tries to catch one of 2 possible animals: a mouse or a bird. How many ways are there for Clare to feed the cats? | three | null | null | null |
12 | parametrisation | Clare has twelve cats. Every day, she decides which cats she will feed. How many ways are there for Clare to feed the cats? | twelve | null | null | null |
13 | math | In an urn there are 10 balls numbered 1 to 10. You draw 7 times without replacement. How many distinct sets of balls are there? | 10 | 3 | null | null |
13 | common | There are 10 pupils and only 3 places on a bus to Disneyland. How many ways are there to pick the unlucky pupils? | 10 | 3 | null | null |
13 | linguistic_obfuscation | A witch is impressed with her class of ten apprentices and wants to reward them with advanced lessons. She can only deliver these lessons to 3 of the apprentices. Therefore, she needs to decide who will be excluded from these lessons. She needs to prepare a teaching schedule – how many ways to select which group of apprentices will be excluded. | 10 | 3 | null | null |
13 | adversarial | There are 10 pupils and only 3 places on a bus to Disneyland. There are 8 different attractions available in the theme park. How many ways are there to pick the unlucky pupils? | 10 | 3 | null | null |
13 | parametrisation | There are 33 pupils and only 7 places on a bus to Disneyland. How many ways are there to pick the unlucky pupils? | 33 | 7 | null | null |
14 | math | In how many ways can you break up the number 100 into a sum of integers of 5, 10 and 50? The ordering of the integers does not matter. | 100 | null | null | null |
14 | common | A console costs 100 pounds. You want to buy the console in cash. You have several banknotes of 5, 10 and 50 pounds. How many ways to pay are there so that there is no need for a change? | 100 | null | null | null |
14 | linguistic_obfuscation | Logging on the planet Pandora is essential for the production of tables big enough for many galactic species. A log in Pandora is being sliced into pieces to make tables for Navi. The log is 100m long. It can be cut in slices of 5m, 10m or 50m so that it can produce a small, medium or large table, respectively. How many distinct constellations of tables can be produced by the log? | 100 | null | null | null |
14 | adversarial | A console, which comes with a new game from the latest collection of 5 games, costs 100 pounds. You want to buy the console in cash. You have several banknotes of 5, 10 and 50 pounds. How many ways to pay are there so that there is no need for a change? | 100 | null | null | null |
14 | parametrisation | A console costs 200 pounds. You want to buy the console in cash. You have several banknotes of 5, 10 and 50 pounds. How many ways to pay are there so that there is no need for a change? | 200 | null | null | null |
15 | math | There are two urns, Urn 1 with balls 1, 3, 5 and Urn 2 with balls 2 and 4. You draw from Urn 1, then from Urn 2, then back to Urn 1, and so on. You always draw without replacement. How many sequences can you create? | 3 | 2 | 5 | null |
15 | common | There are 3 red balls and 2 blue balls. Red balls are labelled with odd numbers between 1 and 5, blue balls are labelled with even numbers between 1 and 5. In how many ways can we arrange them in a line, so that no balls of the same color are next to each other? | 3 | 2 | 5 | null |
15 | linguistic_obfuscation | The queen is arranging guests at her banquet table, in one long line. She has guests from her own family and from her husband's family. From her husband's side, there are three guests: her brother-in law, her mother-in-law and her father-in-law. From her own side, there are two guests: her sister and her niece. Court etiquette requires that family members from the same family can under no circumstances be placed together. In how many ways can she arrange her guests? | 3 | 2 | 5 | null |
15 | adversarial | There are 3 red balls and 2 blue balls. Red balls are labelled with odd numbers between 1 and 5, blue balls are labelled with even numbers between 1 and 5. If a ball's number is divisible by 3, it is metal, otherwise it is wooden. In how many ways can we arrange them in a line, so that no balls of the same color are next to each other? | 3 | 2 | 5 | null |
15 | parametrisation | There are 12 red balls and 11 blue balls. Red balls are labelled with odd numbers between 1 and 23, blue balls are labelled with even numbers between 1 and 23. In how many ways can we arrange them in a line, so that no balls of the same color are next to each other? | 12 | 11 | 23 | null |
16 | math | There is a sequence of 7 balls labelled zero and 5 balls labelled 1 to 5, respectively. How many distinct permutations are there if non-zero balls cannot stand next to each other? | 12 | 5 | null | null |
16 | common | Simone has 12 books on her shelf. In how many ways can she pick 5 books which do not currently stand together? | 12 | 5 | null | null |
16 | linguistic_obfuscation | You are making an exercise plan for a top athlete. The athlete needs to practice stretching, running, shooting, skiing, swimming sessions. Each session must take a full day of practice. There are 12 days left before the biathlon competition. The athlete cannot exercise more than one day in a row without taking a full day of rest. How many different exercise plans can you make? | 12 | 5 | null | null |
16 | adversarial | Simone has 12 books on her shelf, each of which cost 10 pounds. In how many ways can she pick 5 books which do not currently stand together? | 12 | 5 | null | null |
16 | parametrisation | Simone has 35 books on her shelf. In how many ways can she pick 10 books which do not currently stand together? | 35 | 10 | null | null |
17 | math | In an urn there are balls in 4 colours, 13 of each type labelled from 1 to 13. You draw 4 times without replacement. How many sets of balls with 4 distinct colours are there? | 4 | null | null | null |
17 | common | How many ways are there to choose 4 cards of different suits from a full deck of cards? | 4 | null | null | null |
17 | linguistic_obfuscation | You have become ruler over 4 planetary systems. Each system has 13 planets. You now have 52 planets that are your property, each with beautiful landscapes, beaches and mountains. Where to holiday first? It's a hard choice. You decide that in the first year, you will make 4 holidays, each in a different planetary system. How many different ways to spend this year's holidays are there? | 4 | null | null | null |
17 | adversarial | You have 3 identical decks of cards and you pick one of them. How many ways are there to choose 4 cards of different suits from a full deck of cards? | 4 | null | null | null |
17 | parametrisation | How many ways are there to choose 2 cards of different suits from a full deck of cards? | 2 | null | null | null |
18 | math | There are two urns containing 3 and 5 objects, respectively. How many ways to pick one from each urn? | 3 | 5 | null | null |
18 | common | There are 3 roads between Cambridge and London, and 5 roads between London and Oxford. How many ways are there to travel from Cambridge to Oxford through London? | 3 | 5 | null | null |
18 | linguistic_obfuscation | A knight, who lives in Greenfields town, intends to participate at the annual jousting event. First, he has to go Ponyville town, where he will get his noble horse. There are 3 roads between Greenfields and Ponyville. He has a choice of 7 horses at Ponyville. After that, he has to go to Saddleford town and pick the brand-new shiny and comfortable saddle. There are 5 roads between Ponyville and Saddleford. How many ways are there to travel from Greenfields to Saddleford through Ponyville? | 3 | 5 | null | null |
18 | adversarial | There are 3 roads between Cambridge and London, 5 roads between London and Oxford, and 7 roads between Liverpool and London. How many ways are there to travel from Cambridge to Oxford through London? | 3 | 5 | null | null |
18 | parametrisation | There are 11 roads between Cambridge and London, and 20 roads between London and Oxford. How many ways are there to travel from Cambridge to Oxford through London? | 11 | 20 | null | null |
19 | math | There is an urn with 9 balls numbered 1 to 9. You draw 2 times without replacement. How many distinct permutations are there? | one move | null | null | null |
19 | common | Two players are playing tic-tac-toe. They just started a new game, and each player made one move. How many game positions are there at this stage of the game? | one move | null | null | null |
19 | linguistic_obfuscation | I am getting married and my divorced parents will be attending the wedding. My mother and father do not like each other and cannot stand being in the same room. My mansion has nine bedrooms, so, I can assign one room for my mother and another for my father. How many are there to allocate rooms to my parents? | one move | null | null | null |
19 | adversarial | Two players are playing tic-tac-toe. The size of their board is 13 centimeters by 13 centimeters. They just started a new game, and each player made one move. How many game positions are there at this stage of the game? | one move | null | null | null |
19 | parametrisation | Two players are playing tic-tac-toe. They just started a new game, and each player made two moves. How many game positions are there at this stage of the game? | two moves | null | null | null |
20 | math | How many distinct strings could be created from the string ABCDE if A must go before B and C must go before D? | socks, shoes and a hat | null | null | null |
20 | common | Andrii is trying to put some clothes on. He has to put on socks, shoes and a hat. In how many ways can he do it? | socks, shoes and a hat | null | null | null |
20 | linguistic_obfuscation | You oversee two islands and a ceremonial boat, and your job is to make sure several preparations for an important festival are made. On each island, the highest tree needs to be felled and then carved into a totem to be placed on the beach. As soon as one of the two tree is felled, a telegram is transmitted to the mainland and given a time stamp. When one of the two totems is placed on the beach, another telegram is transmitted. You also need to make sure the ceremonial boat is decorated. Again, when this task is finished, a telegram is transmitted. You have workers on each island, and on the boat. You do not know how long each task takes. At the end of the preparations, you look a the order of the incoming telegrams. How many different sequences are there in which the telegrams can come in? | socks, shoes and a hat | null | null | null |
20 | adversarial | To get to a formal event, Andrii has ordered a taxi, which will arrive at 7 o'clock. But, first, he has to put on some clothes: socks, shoes and a hat. In how many ways can he do it? | socks, shoes and a hat | null | null | null |
20 | parametrisation | Andrii is trying to put some clothes on. He has to put on socks, shoes, gloves and a hat. In how many ways can he do it? | socks, shoes, gloves and a hat | null | null | null |
End of preview. Expand
in Dataset Viewer.
Combi-Puzzles Dataset
This repository contains the Combi-Puzzles dataset used in the research paper titled "Can Language Models Rival Mathematics Students? Evaluating Mathematical Reasoning through Textual Manipulation and Human Experiments."
Abstract
In this study, we examine the ability of recent large language models (LLMs), including LLaMA-2, LLaMA-3.1, GPT-4, and Mixtral, in solving mathematical problems in combinatorics. We introduce the Combi-Puzzles dataset, consisting of 125 problem variants derived from 25 core combinatorial problems, to facilitate these comparisons. The dataset assesses the generalizability of LLMs and includes variations like adversarial, parameterization, and linguistic obfuscation to test models and humans alike.
Dataset Description
The Combi-Puzzles dataset includes:
- 25 Base Combinatorial Problems: Covers permutations, combinations, rules of addition/multiplication, and object arrangements.
- 5 Variations per Problem:
- Common: Standard textbook form.
- Mathematical: Academic, technical presentation.
- Adversarial: Includes additional irrelevant information.
- Parameterisation: Altered numerical parameters.
- Linguistic Obfuscation: Narrative fictional stories with problem context.
These variations are designed to thoroughly evaluate problem-solving strategies across different formats.
Additional Information
The Combi-Puzzles dataset contains problems that have parameters expressed in string format (e.g. 12 as "twelve"). These problems are identified as:
- Problems' ID with String Parameters: 6, 12, 19, 20.
Please note that all parameters are stored as strings in the dataset to ensure consistency.
Usage
You are encouraged to use this dataset to further evaluate problem-solving strategies in LLMs or other domains. Please cite our paper if you publish material based on this dataset.
License
This dataset is licensed under the MIT License. See the LICENSE file for more details.
Citation
Please cite the following if you use the dataset in your work:
@misc{nikolaiev2024languagemodelsrivalmathematics,
title={Can Language Models Rival Mathematics Students? Evaluating Mathematical Reasoning through Textual Manipulation and Human Experiments},
author={Andrii Nikolaiev and Yiannos Stathopoulos and Simone Teufel},
year={2024},
eprint={2412.11908},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2412.11908},
}
- Downloads last month
- 6