Skip to main content

All Questions

2 votes
0 answers
41 views

Dividing $N$ coins into at most $K$ groups such that I can get any number of coins by selecting whole groups

Problem Inspired from Dividing $100$ coins into $7$ groups such that I can choose any number of coins by selecting whole groups . I am interested in the number of possible ways we can get such a split....
EnEm's user avatar
  • 1,171
0 votes
1 answer
340 views

Why the "sum of permutation inversions" is a non-admissible heuristic for the 8-puzzle? [closed]

A heuristic h(N) is admissible if for every node N, 0 ≤ h(N) ≤ h∗(N) where h*(N) is the true cost to reach the goal state from N. In my opinion, the true cost to reach the goal state from N is 21 for ...
Erik Varga's user avatar
1 vote
0 answers
277 views

Rephrase a simple mathy logic problem (yielding solution of an ordered procedure), and its generalized counterpart, into a solvable algorithm.

I'm given a selection of logic puzzles about different entities crossing a river safely (either from the same side to the same other side, or switching sides; utilizing the same boat, with certain ...
whattheodds's user avatar
1 vote
2 answers
145 views

Couple problems and classic wolf/goat/cabbage and abstraction

I was reviewing Dijkstra's approach on the problem/puzzle of how 2 married couple can cross a river with 1 boat that can carry 2 people. The original problem's restriction is that the wife can't be in ...
Jim's user avatar
  • 1,609
2 votes
1 answer
156 views

Generallizing independent weighings solution for coin weighing puzzle

There is a puzzle that goes something like "you have $n$ coins with $m$ uses of s balance scale allowed; find out coin with the different weight" (normally given with $n=12$ and $m=3$). ...
user760900's user avatar
4 votes
0 answers
159 views

Minimizing floor space needed to store $N$ unit cubes, subject to two placement rules

There is a store room which has only three sides all touching each other perpendicularly, the sides can be defined as: two infinitely large walls and one infinitely large floor. There are $N$ cubes ...
coder_a's user avatar
  • 71
8 votes
1 answer
754 views

Leapfrogs puzzle -- Least number of moves needed to interchange the pegs

This is a question from the book "Thinking Mathematically" by Burton and Mason. Question: Ten pegs of two colors are laid out in a line of 11 holes as shown below. I want to interchange the ...
TryingHardToBecomeAGoodPrSlvr's user avatar
1 vote
2 answers
195 views

Finding the maximum value of elements to be selected in a grid - ZIO $2009$, P$1$

Hello Community! The above problem you see is a problem I got wrong. :( This is ZIO $2009$, P$1$. I tried the problem and miserably found the wrong answer as $20$. Here is how my approach goes - part ...
Vasu090's user avatar
  • 779
1 vote
3 answers
70 views

Minimizing the operations to be done on letters - ZIO $2014$, P$1$

Hello everybody! The above problem is a combinatorics problem I could not solve. :( This is ZIO $2014$, P$1$. Here is my approach (feel free to point out any mistakes in it, that's why I am asking ...
Vasu090's user avatar
  • 779
1 vote
1 answer
156 views

Finding a binary sequence given sorted and end sequence - ZIO $2011$ P$4$

Hello everybody! The above problem you see is a combinatorics problem I could not solve. :( The answers are $00110111, 000111011011$ and $001111011101011$. This is problem $4$ from ZIO $2011$. Notice ...
Vasu090's user avatar
  • 779
0 votes
0 answers
22 views

Minimizing the number of operations of subtracting one so as to get to $0$ [duplicate]

Hello Community! The above problem you see is a combinatorics problem, more like an algorithmic problem that I could not solve. :( This problem requires that every child gets satisfied. In brief ...
Vasu090's user avatar
  • 779
2 votes
1 answer
408 views

Explanation of Freeman Dyson's solution of the counterfeit coin problem

Freeman Dyson's paper, The problem of the pennies Math. Gaz., 30 (1946) 231-234, offers a solution to a counterfeit coin detection problem. I quote his solution of one case as follows. I would ...
Hans's user avatar
  • 9,917
1 vote
1 answer
332 views

Generating all possible Domino tilings on a $4 \times 4$ grid

I have a task to write a program which generates all possible combinations of tiling domino on a $4 \times 4$ grid. I have found many articles about tilings, but it is for me quite difficult and I ...
Adam A's user avatar
  • 11
5 votes
1 answer
163 views

Minimal number of questions to identify a subset

This is a curiosity question. Recently I stumbled across the following problem : Given three integers $k,m, n$ such that $m+k\leq n$. A friend chooses a subset $S\subseteq\lbrace1,\ldots,N\rbrace$...
Elaqqad's user avatar
  • 13.8k
1 vote
0 answers
281 views

Cyclic Partisan Nim Variant

This game is played with a sequence of heaps and a position marker, where each heap is owned by exactly one player. The game ends when a player has removed all objects from their own heaps, and this ...
D. G.'s user avatar
  • 330

15 30 50 per page