Skip to main content

All Questions

1 vote
1 answer
62 views

How to discover a recursive relation in a data set?

For a set of data, $x(n)$, where $n = 1, 2, 3, ...$, we know there are some kind of recursive relations among those data, $x(n)$ somehow depends on previous data $x(n-1), x(n-2), ...x(1)$, but we do ...
david's user avatar
  • 553
0 votes
1 answer
266 views

Algorithm verification: Get all the combinations of possible words

I wanted to know if the algorithm that i wrotte just below in python is correct. My goal is to find an algorithm that print/find all the possible combinaison of words that can be done using the ...
X0-user-0X's user avatar
1 vote
0 answers
81 views

If chess is deterministic, can we prove that from a set of infinitely large number of games, that white always wins/doesn't win?

In some lesser complex games such as Tic-tac-toe or connect4, the first person can force a win/draw. Can we prove the same in a much more complex game like chess, where white can force a win/draw?.
fractals's user avatar
2 votes
0 answers
192 views

Proof that my greedy algorithm for assigning candidates to jobs works

I was using the answers on this question as a guide for proving that my greedy algorithm is correct. (Unfortunately, CS Stack Exchange does not accept proof verification questions, which is why I ...
EJoshuaS - Stand with Ukraine's user avatar
3 votes
2 answers
754 views

How to calculate the number of possible multiset partitions into N disjoint sets?

I have made a Ruby program, which enumerates the possible multiset partitions, into a given number of disjoint sets (N), also called bins. The bins are indistinguishable. They can be sorted in any ...
Konstantin's user avatar
1 vote
1 answer
354 views

Random knapsack algorithm: Select n positive integers that sum up to S

Problem to solve: Have a list of M products (eg 100000) with various prices. I want to randomly select n products(eg 10) that their sum of prices is S(eg. 100). Duplicates are allowed or not, does ...
Jannes Botis's user avatar
-2 votes
2 answers
451 views

Properties of a Matrices whose columns and rows all add to the same value.

Given a matrix A =(aij) that sum of the entries on any row of A is equal to δ and the sum of the entries on any column of A is equal to δ. I was wondering if B=(bij) also has these properties, such ...
HugHes's user avatar
  • 13
2 votes
2 answers
223 views

Greedy algorithm in matching students to juries that they like with an upper bound number of students each jury can check

Recently I solved this following problem using greedy algorithm. There are $100$ students who participate at exam.Also there are $25$ members of jury.Each student is checked by one jury.Known that ...
Tengu's user avatar
  • 4,102
1 vote
1 answer
108 views

How to know no matter what method you use to count inversions, a given set always has the same number?

This may be a bad question. Right now I'm learning algorithms for counting inversions. My question is, how do you know that no matter how you examine a set of numbers, you will always count the same ...
Celeritas's user avatar
  • 2,783
3 votes
1 answer
79 views

Dependency of submatrix used in a combinatorial strategy .

This is a verification post , Please inform if anything is undefined or unclear or miss-tagged. Also if you vote up/down it would be helpfull if you leave a comment. Introduction: Given a matrix A of ...
Michael's user avatar
  • 499