Questions tagged [optimization]

A mathematical puzzle where you have to optimize a certain objective function (maximize profit, minimize cost).

Filter by
Sorted by
Tagged with
6
votes
2answers
263 views

Savage Road Signs (Part 3)

You only need to have read Part 1 to understand this question, reading Part 2 will only help understanding the epic storyline. Your daughter refuses to talk to you even though you have (once more) ...
2
votes
3answers
381 views

Optimal path around a variable-position wall [closed]

This is a harder version of the fixed wall variation. Every day you walk across a flat plane from a point $A$ to a point $B$. The points are $3$ miles apart. However, every day there is a 50% ...
0
votes
2answers
269 views

How can 32 teams rotate through 8 games without overlaps? [closed]

So I have to arrange a rotation schedule for a tournament. We're aiming for 32 teams. There will be 8 stations and 4 teams competing simultaneously at each station. We want all 32 teams to hit each ...
17
votes
4answers
3k views

Smallest PRIME containing the first 11 primes as sub-strings

In Smallest number containing the first 11 primes as sub-strings, @Alconja successfully found the smallest number which contains the first eleven primes (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31) as ...
11
votes
2answers
3k views

The grades of the students in a class

You are a new Math 102 professor in a university class of 88 students and would like to learn their grades from previous semester to know your students better and put a note of it to get an idea how ...
9
votes
1answer
602 views

Maximize 'chains' in a Sudoku

Yet to be solved. Take 2 numbers such that $N, M \in \{1,2,3,4,5,6,7,8,9\}; N \ne M$. Start with a solved 9x9 Sudoku grid. Find any $N_1 = N$. Find an $M_1 = M$, in the same row as $N_1$. In the ...
9
votes
1answer
259 views

Get 6 pawns in file A or H without promoting

This is wholly inspired by Get 6 pawns in file A or H Is it possible for either white or black to get 6 pawns of the same colour in file A or in file H (you must choose one) without promoting?# If ...
7
votes
1answer
565 views

This ant sure is smart. But how fast is it?

A mad scientist uses ethically questionable methods to study the spatial cognition of ants. Last time, he left his lab ant in a cubic room and filled it with painfully intoxicating gas, capable of ...
6
votes
1answer
173 views

De-zephyr The Solution!

Here's another original chess problem of mine for you all to solve today! In the following position, White wants to stalemate Black even though they can win, for unknown, unclear, unexplained, and ...
5
votes
1answer
209 views

Square Spin #3: Hickory Dickory Dock

Square Spin History: #1>#2>#3 Recap of the Rules Basic rules from #1 Ambiguity, Un and Re squares from #2 Problem #3: Hickory Dickory Dock The mouse ran up the clock. ...but ...
4
votes
1answer
441 views

Are there basic weighing puzzles requiring adaptive strategies?

Let us define a basic weighing puzzle as such: There are <number> identical balls, except one weighs <more/less/a different amount than the others> A balance scale may be used to weigh two ...
4
votes
2answers
515 views

Lock Optimisation

In a simple combination lock, a sequence of several digits is used as a password, with one wheel per digit. Generally, it is not possible to unlock the lock without knowing the password, but due to ...
2
votes
2answers
262 views

How many different results?

$a,b,c,d,e,f,g,h,i$ are real numbers and you would like to calculate the equation below by adding as many paranteses as you want: a-b^c-d/e+f/g^h*i What is the maximum amount of different results ...
2
votes
3answers
181 views

Make the largest box from a cardboard sheet Chapter #2

Please see: Make the largest box from a cardboard sheet Thanks to his older brother's friends: @Oray, @Weather Vane and @mlk, the boy managed to make as large cardboard box as possible. Unfortunately,...
1
vote
1answer
838 views

The swap puzzle

The swap puzzle Place small coins heads up on the squares marked H and tails up on the squares marked T. Swap the positions of the Heads for the Tails in as few moves as possible. There are two ways ...